BibSLEIGH — source code tag

source code

source code
Wikidata

Q128751

Tag #source code

3591 papers:

POPL-2020-AschieriG #concurrent #functional #linear #logic #parallel #proving: Par means parallel: multiplicative linear logic proofs as concurrent functional programs (FA, FAG), p. 28.
POPL-2020-BansalNS #coordination #linear #specification #synthesis: Synthesis of coordination programs from linear temporal specifications (SB, KSN, YS), p. 27.
POPL-2020-BartheHYYZ #proving #quantum #relational: Relational proofs for quantum programs (GB, JH, MY, NY, LZ), p. 29.
POPL-2020-DahlqvistK #higher-order #probability #semantics: Semantics of higher-order probabilistic programs with conditioning (FD, DK), p. 29.
POPL-2020-Jaber #automation #equivalence #higher-order #named: SyTeCi: automating contextual equivalence for higher-order programs with references (GJ), p. 28.
POPL-2020-KavvosMLD #call-by #functional: Recurrence extraction for functional programs through call-by-push-value (GAK, EM, DRL, ND), p. 31.
POPL-2020-LeeYRY #probability #towards: Towards verified stochastic variational inference for probabilistic programs (WL0, HY, XR, HY), p. 33.
POPL-2020-MathurMKMV #memory management #safety: Deciding memory safety for single-pass heap-manipulating programs (UM, AM, PK, PM, MV0), p. 29.
POPL-2020-RaghothamanMZNS #datalog #synthesis: Provenance-guided synthesis of Datalog programs (MR, JM, DZ, MN, BS), p. 27.
POPL-2020-SmolkaFHKKS #algebra #linear #testing #verification: Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time (SS, NF, JH, TK, DK, AS0), p. 28.
POPL-2020-WangFCDX #probability #proving #random #termination: Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time (PW, HF0, KC, YD, MX), p. 30.
POPL-2020-WestrickYFA: Disentanglement in nested-parallel programs (SW, RY, MF, UAA), p. 32.
POPL-2020-XiaZHHMPZ #coq #interactive #recursion #representation: Interaction trees: representing recursive and impure programs in Coq (LyX, YZ, PH, CKH, GM, BCP, SZ), p. 32.
ASPLOS-2020-0001SWWKK #debugging #detection #memory management #persistent: Cross-Failure Bug Detection in Persistent Memory Programs (SL0, KS, YW, TFW, AK, SK), pp. 1187–1202.
CGO-2020-JoshiFM #approximate #named #reliability #verification: Aloe: verifying reliability of approximate programs in the presence of recovery mechanisms (KJ, VF, SM), pp. 56–67.
CGO-2020-VermaKPR #concurrent #debugging #interactive #memory management #modelling: Interactive debugging of concurrent programs under relaxed memory models (AV, PKK, AP, SR), pp. 68–80.
CSL-2020-Buss0K #branch #complexity #nondeterminism #proving: Proof Complexity of Systems of (Non-Deterministic) Decision Trees and Branching Programs (SB, AD0, AK), p. 17.
EDM-2019-YahyaMO #data mining #education #effectiveness #mining #novel #using: A Novel Use of Educational Data Mining to Inform Effective Management of Academic Programs (AAY, FAM, AO).
ICPC-2019-FakhouryRHA #readability #theory and practice: Improving source code readability: theory and practice (SF, DR, SAH, VA), pp. 2–12.
ICSME-2019-Guarnera #eye tracking: Enhancing Eye Tracking of Source Code: A Specialized Fixation Filter for Source Code (DTG), pp. 615–618.
ICSME-2019-HataNNKH #android #named: OSAIFU: A Source Code Factorizer on Android Studio (MH, MN, KN, HK, TH), pp. 422–425.
ICSME-2019-JohnsonLYAS #comprehension #empirical #readability: An Empirical Study Assessing Source Code Readability in Comprehension (JJ, SL, NY, JA, BS), pp. 513–523.
ICSME-2019-LevinY #dataset #scalability: Processing Large Datasets of Fined Grained Source Code Changes (SL, AY), pp. 382–385.
ICSME-2019-TufanoWBPWP #how #learning: Learning How to Mutate Source Code from Bug-Fixes (MT, CW, GB, MDP, MW, DP), pp. 301–312.
MSR-2019-AkbarK #named #order #retrieval #semantics: SCOR: source code retrieval with semantics and order (SAA, ACK), pp. 1–12.
MSR-2019-EfstathiouS #identifier #modelling #semantics #using: Semantic source code models using identifier embeddings (VE, DS), pp. 29–33.
MSR-2019-YangC0 #behaviour #development #predict #specification: Predicting co-changes between functionality specifications and source code in behavior driven development (AZHY, DAdC, YZ0), pp. 534–544.
MSR-2019-ZhaiCD #python #test coverage: Test coverage in python programs (HZ, CC, PTD), pp. 116–120.
SANER-2019-PizzolottoFC #android #java #named #obfuscation: OBLIVE: Seamless Code Obfuscation for Java Programs and Android Apps (DP, RF, MC), pp. 629–633.
SANER-2019-QiZ #concurrent #testing: A Splitting Strategy for Testing Concurrent Programs (XQ, HZ), pp. 388–398.
FM-2019-BeringerA #abstraction #c #composition #verification: Abstraction and Subsumption in Modular Verification of C Programs (LB, AWA), pp. 573–590.
FM-2019-PhamLP0 #testing: Concolic Testing Heap-Manipulating Programs (LHP, QLL, QSP, JS0), pp. 442–461.
SEFM-2019-RockaiBMKB #execution: Reproducible Execution of POSIX Programs with DiOS (PR, ZB, JM, KK, JB), pp. 333–349.
SEFM-2019-StillB #c++ #detection #parallel: Local Nontermination Detection for Parallel C++ Programs (VS, JB), pp. 373–390.
Haskell-2019-ChristiansenDB #coq #haskell #verification: Verifying effectful Haskell programs in Coq (JC, SD, NB), pp. 125–138.
Haskell-2019-Finkbeiner0PS #functional: Synthesizing functional reactive programs (BF, FK0, RP, MS), pp. 162–175.
Haskell-2019-MokhovLL #case study #experience #verification: Formal verification of spacecraft control programs (experience report) (AM, GL, JL), pp. 139–145.
Haskell-2019-PickeringWK #multi: Multi-stage programs in context (MP, NW, CK), pp. 71–84.
ICFP-2019-QuG0 #cost analysis #relational: Relational cost analysis for functional-imperative programs (WQ, MG, DG0), p. 29.
ICFP-2019-SmithA: Synthesizing differentially private programs (CS, AA), p. 29.
ICFP-2019-TimanyB #concurrent #continuation #relational #verification: Mechanized relational verification of concurrent programs with continuations (AT, LB), p. 28.
FDG-2019-EgertP #design #development #game studies: Tenure and promotion in the next era of game design and development programs: some thoughts and observations (CAE, AMP), p. 7.
CIKM-2019-LiLXLC #how: How to Find It Better?: Cross-Learning for WeChat Mini Programs (HL, ZL, SX, ZL, XC), pp. 2753–2761.
ICML-2019-CvitkovicSA #learning: Open Vocabulary Learning on Source Code with a Graph-Structured Cache (MC, BS, AA), pp. 1475–1485.
ECOOP-2019-LopezSMBS #debugging #idea #multi #nondeterminism: Multiverse Debugging: Non-Deterministic Debugging for Non-Deterministic Programs (Brave New Idea Paper) (CTL, RGS, SM, EGB, CS), p. 30.
ECOOP-2019-SotiropoulosL #javascript #static analysis: Static Analysis for Asynchronous JavaScript Programs (TS, BL), p. 30.
OOPSLA-2019-CambroneroR #learning #named: AL: autogenerating supervised learning programs (JPC, MCR), p. 28.
OOPSLA-2019-FernandoJM #approximate #canonical #parallel #safety #verification: Verifying safety and accuracy of approximate parallel programs via canonical sequentialization (VF, KJ, SM), p. 29.
OOPSLA-2019-Huang0CG #composition #probability #termination #verification: Modular verification for almost-sure termination of probabilistic programs (MH, HF0, KC, AKG), p. 29.
OOPSLA-2019-MastrangeloHN #empirical #java: Casting about in the dark: an empirical study of cast operations in Java programs (LM, MH, NN), p. 31.
OOPSLA-2019-Nanevski0DF #concurrent #logic #morphism #simulation #specification: Specifying concurrent programs in separation logic: morphisms and simulations (AN, AB0, GAD, IF), p. 30.
OOPSLA-2019-WangCMH #c #data type: Certifying graph-manipulating C programs via localizations within data structures (SW, QC, AM, AH), p. 30.
PADL-2019-Hanus #declarative: Improving Residuation in Declarative Programs (MH), pp. 82–97.
PADL-2019-HippenL #automation #set: Automatic Program Rewriting in Non-Ground Answer Set Programs (NH, YL), pp. 19–36.
PADL-2019-Lierler #equivalence #first-order #logic programming: Strong Equivalence and Program's Structure in Arguing Essential Equivalence Between First-Order Logic Programs (YL), pp. 1–18.
PEPM-2019-WatanabeTO0 #higher-order #reduction #verification: Reduction from branching-time property verification of higher-order programs to HFL validity checking (KW, TT, HO, NK0), pp. 22–34.
PLDI-2019-0001DSD #database #refactoring: Synthesizing database programs for schema refactoring (YW0, JD, RS, ID), pp. 286–300.
PLDI-2019-AbdullaAAK #semantics #verification: Verification of programs under the release-acquire semantics (PAA, JA0, MFA, SNK), pp. 1117–1132.
PLDI-2019-HeoRSN #difference #reasoning #using: Continuously reasoning about programs using differential Bayesian inference (KH, MR, XS, MN), pp. 561–575.
PLDI-2019-JiangLXZF #compilation #concurrent #towards: Towards certified separate compilation for concurrent programs (HJ, HL, SX, JZ, XF), pp. 111–125.
PLDI-2019-NguyenGTH #contract #higher-order #termination: Size-change termination as a contract: dynamically and statically enforcing termination for higher-order programs (PCN, TG, STH, DVH), pp. 845–859.
PLDI-2019-ScalasYB #behaviour #message passing #verification: Verifying message-passing programs with dependent behavioural types (AS, NY, EB), pp. 502–516.
PLDI-2019-VollmerKRS0N #named: LoCal: a language for programs operating on serialized data (MV0, CK, MR, LS, MK0, RRN), pp. 48–62.
PLDI-2019-Wang0GCQS #cost analysis #nondeterminism #probability: Cost analysis of nondeterministic probabilistic programs (PW, HF0, AKG, KC, XQ, WS), pp. 204–220.
PLDI-2019-ZhangX #incremental #probability: Incremental precision-preserving symbolic inference for probabilistic programs (JZ, JX), pp. 237–252.
POPL-2019-BatzKKMN #logic #pointer #probability #reasoning: Quantitative separation logic: a logic for reasoning about probabilistic pointer programs (KB, BLK, JPK, CM, TN0), p. 29.
POPL-2019-ChenHLRW #string: Decision procedures for path feasibility of string-manipulating programs with complex operations (TC, MH, AWL, PR, ZW), p. 30.
POPL-2019-GleissenthallKB #distributed #verification: Pretend synchrony: synchronous verification of asynchronous distributed programs (KvG, RGK, AB, DS, RJ), p. 30.
POPL-2019-HungHZYHW #analysis #quantum #robust: Quantitative robustness analysis of quantum programs (SHH, KH, SZ, MY, MH0, XW), p. 29.
POPL-2019-MathurMV #decidability #verification: Decidable verification of uninterpreted programs (UM, PM, MV0), p. 29.
POPL-2019-PolikarpovaS #synthesis: Structuring the synthesis of heap-manipulating programs (NP, IS), p. 30.
POPL-2019-SaadCSRM #automation #modelling #probability #synthesis: Bayesian synthesis of probabilistic programs for automatic data modeling (FAS, MFCT, US, MCR, VKM), p. 32.
POPL-2019-SatoABGGH #approximate #convergence #higher-order #optimisation #probability #reasoning #verification: Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization (TS, AA0, GB, MG, DG0, JH), p. 30.
POPL-2019-TassarottiH #concurrent #logic #random: A separation logic for concurrent randomized programs (JT, RH0), p. 30.
QAPL-2019-Kirkeby #analysis #probability #reuse: Probabilistic Output Analyses for Deterministic Programs - Reusing Existing Non-probabilistic Analyses (MHK), pp. 43–57.
SAS-2019-0001NIU #first-order #fixpoint #logic #verification: Temporal Verification of Programs via First-Order Fixpoint Logic (NK0, TN, AI, HU0), pp. 413–436.
SAS-2019-HuSSD #imperative: Direct Manipulation for Imperative Programs (QH, RS, RS, LD), pp. 347–367.
SAS-2019-OkuyamaT0 #functional #higher-order #logic: A Temporal Logic for Higher-Order Functional Programs (YO, TT, NK0), pp. 437–458.
SAS-2019-YinCL0C #testing #verification: Verifying Numerical Programs via Iterative Abstract Testing (BY, LC, JL, JW0, PC), pp. 247–267.
ASE-2019-FischerTP #concurrent #multi #thread: VeriSmart 2.0: Swarm-Based Bug-Finding for Multi-threaded Programs with Lazy-CSeq (BF, SLT, GP), pp. 1150–1153.
ASE-2019-LiuHGN #predict: Predicting Licenses for Changed Source Code (XL, LH, JG, VN), pp. 686–697.
ASE-2019-LiuSTWY #c #encryption #verification: Verifying Arithmetic in Cryptographic C Programs (JL, XS, MHT, BYW, BYY), pp. 552–564.
ASE-2019-Lukasczyk #dynamic typing #generative #testing: Generating Tests to Analyse Dynamically-Typed Programs (SL), pp. 1226–1229.
ASE-2019-MaYLYZ #c++ #fault #named #pointer #static analysis: SPrinter: A Static Checker for Finding Smart Pointer Errors in C++ Programs (XM, JY, YL, JY0, JZ), pp. 1122–1125.
ASE-2019-Mudduluru #verification: Verifying Determinism in Sequential Programs (RM), pp. 1271–1273.
ASE-2019-PobeeMC #concurrent #multi #performance #thread #transaction: Efficient Transaction-Based Deterministic Replay for Multi-threaded Programs (EBP, XM, WKC), pp. 760–771.
ASE-2019-SadiqLLAL #contract #java #named: Sip4J: Statically Inferring Access Permission Contracts for Parallelising Sequential Java Programs (AS, LL, YFL, IA, SL), pp. 1098–1101.
ASE-2019-Sharma #adaptation #automation #synthesis #using: Automatically Repairing Binary Programs Using Adapter Synthesis (VS), pp. 1238–1241.
ASE-2019-WanSSXZ0Y #learning #multi #network #retrieval #semantics: Multi-modal Attention Network Learning for Semantic Source Code Retrieval (YW, JS, YS, GX, ZZ, JW0, PSY), pp. 13–25.
ESEC-FSE-2019-He #comprehension #scalability: Understanding source code comments at large-scale (HH), pp. 1217–1219.
ESEC-FSE-2019-PobeeC #concurrent #multi #named #performance #thread: AggrePlay: efficient record and replay of multi-threaded programs (EBP, WKC), pp. 567–577.
ESEC-FSE-2019-Sonnekalb #detection: Machine-learning supported vulnerability detection in source code (TS), pp. 1180–1183.
ESEC-FSE-2019-StahlbauerKF #automation #testing: Testing scratch programs automatically (AS, MK, GF), pp. 165–175.
ESEC-FSE-2019-Wang0LXBXW #approach #automation #documentation #taxonomy: A learning-based approach for automatic construction of domain glossary from source code and documentation (CW, XP0, ML, ZX, XB, BX, TW), pp. 97–108.
ICSE-2019-HataTKI #evolution: 9.6 million links in source code comments: purpose, evolution, and decay (HH, CT, RGK, TI), pp. 1211–1221.
ICSE-2019-JoshiFM #algorithm #approximate #profiling #random #statistics: Statistical algorithmic profiling for randomized approximate programs (KJ, VF, SM), pp. 608–618.
ICSE-2019-WangWSTCS0WZL #algebra #optimisation #probability: Global optimization of numerical programs via prioritized stochastic algebraic transformations (XW, HW, ZS, ET, XC, WS, ZC0, LW, XZ, XL), pp. 1131–1141.
ICSE-2019-ZhangHMBLU #ltl #named #using: AutoTap: synthesizing and repairing trigger-action programs using LTL properties (LZ, WH, JM, NB, SL, BU), pp. 281–291.
ICSE-2019-ZhangWZ0WL #abstract syntax tree #novel #representation #syntax: A novel neural source code representation based on abstract syntax tree (JZ, XW, HZ0, HS0, KW, XL), pp. 783–794.
SLE-2019-RaselimoTF #fault #generative #parsing #syntax: Breaking parsers: mutation-based generation of programs with guaranteed syntax errors (MR, JT, BF0), pp. 83–87.
ASPLOS-2019-0001WZKK #flexibility #framework #memory management #named #performance #persistent #testing: PMTest: A Fast and Flexible Testing Framework for Persistent Memory Programs (SL0, YW, JZ, AK, SMK), pp. 411–425.
CC-2019-KSKP #functional #incremental #slicing: A static slicing method for functional programs and its incremental version (PKK, AS, AK, SP), pp. 53–64.
ESOP-2019-McDermottM #call-by #evaluation #order #reasoning: Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order (DM, AM), pp. 235–262.
ESOP-2019-XiaOW #bidirectional: Composing Bidirectional Programs Monadically (LyX, DO, MW0), pp. 147–175.
FASE-2019-QianZWO #c #modelling #named #verification: KupC: A Formal Tool for Modeling and Verifying Dynamic Updating of C Programs (JQ, MZ0, YW, KO0), pp. 299–305.
CADE-2019-GieslGH #constant #probability: Computing Expected Runtimes for Constant Probability Programs (JG, PG, MH), pp. 269–286.
CAV-2019-DarulovaV #approximate: Sound Approximation of Programs with Elementary Functions (ED, AV), pp. 174–183.
CAV-2019-LiuWL #using #verification: Verifying Asynchronous Event-Driven Programs Using Partial Abstract Transformers (PL, TW, AL), pp. 386–404.
ICST-2019-HaririSFMM #compilation #mutation testing #representation #testing: Comparing Mutation Testing at the Levels of Source Code and Compiler Intermediate Representation (FH, AS, VF, SM, DM), pp. 114–124.
ICST-2019-TannoI #debugging #interactive #realtime: Suspend-Less Debugging for Interactive and/or Realtime Programs (HT, HI), pp. 194–205.
ICTSS-2019-ErardG #bound #testing: Bounded Exhaustive Testing with Certified and Optimized Data Enumeration Programs (CE, AG), pp. 159–175.
ICTSS-2019-NakajimaC #dataset #generative #machine learning #testing: Generating Biased Dataset for Metamorphic Testing of Machine Learning Programs (SN0, TYC), pp. 56–64.
VMCAI-2019-FuC #nondeterminism #probability #termination: Termination of Nondeterministic Probabilistic Programs (HF0, KC), pp. 468–490.
VMCAI-2019-KarlSBM #fault #robust #verification: Small Faults Grow Up - Verification of Error Masking Robustness in Arithmetically Encoded Programs (AFK, RS, RB, SM), pp. 183–204.
VMCAI-2019-LuCC0 #bound: Type-Directed Bounding of Collections in Reactive Programs (TL, PC, BYEC, AT0), pp. 275–296.
ICPC-2018-FakhouryMAA #developer #readability: The effect of poor source code lexicon and readability on developers' cognitive load (SF, YM, VA, OOA), pp. 286–296.
ICPC-2018-SchankinBHHRB #comprehension #identifier: Descriptive compound identifier names improve source code comprehension (AS, AB, DVH, JCH, TR, MB), pp. 31–40.
ICPC-2018-SulirP: Augmenting source code lines with sample variable values (MS, JP), pp. 344–347.
ICSME-2018-LiuHLN: Linking Source Code to Untangled Change Intents (XL, LH, CL, VN), pp. 393–403.
ICSME-2018-Sulir #comprehension #runtime: Integrating Runtime Values with Source Code to Facilitate Program Comprehension (MS), pp. 743–748.
MSR-2018-OttAHBL08 #approach #identification #image #learning #video: A deep learning approach to identifying source code in images and video (JO, AA, PH, AB, EL), pp. 376–386.
MSR-2018-PaixaoKHH #code review #named: CROP: linking code reviews to source code changes (MP, JK, DH, MH), pp. 46–49.
MSR-2018-TorreRB08: Imprecisions diagnostic in source code deltas (GDlT, RR, AB), pp. 492–502.
MSR-2018-TufanoWBPWP08 #learning: Deep learning similarities from different representations of source code (MT, CW, GB, MDP, MW, DP), pp. 542–553.
SANER-2018-DantasCMFSLB #automation #empirical #java #program transformation: Reconciling the past and the present: An empirical study on the application of source code transformations to automatically rejuvenate Java programs (RD, AC, DM, LF, US, WL, RB), pp. 497–501.
SANER-2018-MaruyamaHO #fine-grained #named: ChangeMacroRecorder: Recording fine-grained textual changes of source code (KM, SH, TO), pp. 537–541.
SANER-2018-NguyenNPN #network: A deep neural network language model with contexts for source code (ATN0, TDN, HDP, TNN), pp. 323–334.
SCAM-2018-CosentinoDZRG: [Engineering Paper] Graal: The Quest for Source Code Knowledge (VC, SD, AZ, GR, JMGB), pp. 123–128.
SCAM-2018-DiarraMV #optimisation #plugin: [Engineering Paper] RECKA and RPromF: Two Frama-C Plug-ins for Optimizing Registers Usage in CUDA, OpenACC and OpenMP Programs (RD, AM, BV), pp. 187–192.
SCAM-2018-PizzolottoC #bytecode #java #library #obfuscation #research: [Research Paper] Obfuscating Java Programs by Translating Selected Portions of Bytecode to Native Libraries (DP, MC), pp. 40–49.
FM-2018-AlbertGRS0 #modelling #named #verification: SDN-Actors: Modeling and Verification of SDN Programs (EA, MGZ, AR, MS, AS0), pp. 550–567.
FM-2018-ColvinS #memory management #modelling #verification: A Wide-Spectrum Language for Verification of Programs on Weak Memory Models (RJC, GS), pp. 240–257.
FM-2018-KhannaSRP #verification: Dynamic Symbolic Verification of MPI Programs (DK, SS0, CR, RP), pp. 466–484.
FM-2018-Laneve #analysis #concurrent #lightweight #thread: A Lightweight Deadlock Analysis for Programs with Threads and Reentrant Locks (CL), pp. 608–624.
FM-2018-LetanRCH #composition #coq #verification: Modular Verification of Programs with Effects and Effect Handlers in Coq (TL, YRG, PC, GH), pp. 338–354.
FM-2018-ZhangZSLTLS #composition #concurrent #reasoning: Compositional Reasoning for Shared-Variable Concurrent Programs (FZ, YZ, DS, YL0, AT, SWL, JS0), pp. 523–541.
SEFM-2018-Choi #automation #generative #validation: Automated Validation of IoT Device Control Programs Through Domain-Specific Model Generation (YC), pp. 254–268.
SEFM-2018-LuckowPV #monte carlo: Monte Carlo Tree Search for Finding Costly Paths in Programs (KSL, CSP, WV), pp. 123–138.
Haskell-2018-HandleyH #haskell #named #performance: AutoBench: comparing the time performance of Haskell programs (MATH, GH), pp. 26–37.
ICML-2018-GaninKBEV #image #learning #using: Synthesizing Programs for Images using Reinforced Adversarial Learning (YG, TK, IB, SMAE, OV), pp. 1652–1661.
ICML-2018-HoltzenBM #abstraction #composition #probability: Sound Abstraction and Decomposition of Probabilistic Programs (SH, GVdB, TDM), pp. 2004–2013.
ICML-2018-HuWL #analysis #probability #reduction #using: Dissipativity Theory for Accelerating Stochastic Variance Reduction: A Unified Analysis of SVRG and Katyusha Using Semidefinite Programs (BH, SW, LL), pp. 2043–2052.
KDD-2018-SachanX #framework #parsing: Parsing to Programs: A Framework for Situated QA (MS, EPX), pp. 2140–2149.
Onward-2018-RinardSM #learning: Active learning for inference and regeneration of computer programs that store and retrieve data (MCR, JS0, VM), pp. 12–28.
OOPSLA-2018-AlimadadiZMT #javascript: Finding broken promises in asynchronous JavaScript programs (SA, DZ, MM, FT), p. 26.
PLATEAU-2018-HuangM #algorithm #named #quantum #towards: QDB: From Quantum Algorithms Towards Correct Quantum Programs (YH0, MM), p. 14.
LOPSTR-2018-TitoloMFM #float #testing: Eliminating Unstable Tests in Floating-Point Programs (LT, CAM, MAF, MMM), pp. 169–183.
LOPSTR-2018-TroumpoukisC #higher-order #logic programming: Predicate Specialization for Definitional Higher-Order Logic Programs (AT, AC), pp. 132–147.
PADL-2018-BiermannDS #functional #higher-order #spreadsheet: Rewriting High-Level Spreadsheet Structures into Higher-Order Functional Programs (FB, WD, PS), pp. 20–35.
PADL-2018-Crary #code generation #using: Hygienic Source-Code Generation Using Functors - (Extended Abstract) (KC), pp. 53–60.
PEPM-2018-Jay #normalisation #recursion: Recursive programs in normal form (short paper) (BJ), pp. 67–73.
PLDI-2018-Cusumano-Towner18a #incremental #probability: Incremental inference for probabilistic programs (MCT, BB, TG, MTV, VKM), pp. 571–585.
PLDI-2018-LiuW #analysis #bound #concurrent #interprocedural #named: CUBA: interprocedural Context-UnBounded Analysis of concurrent programs (PL, TW), pp. 105–119.
PLDI-2018-NgoC0 #analysis #bound #probability: Bounded expectations: resource analysis for probabilistic programs (VCN, QC, JH0), pp. 496–512.
PLDI-2018-WangHR #algebra #framework #named #probability #static analysis: PMAF: an algebraic framework for static analysis of probabilistic programs (DW, JH0, TWR), pp. 513–528.
POPL-2018-0001ST #higher-order #nondeterminism #refinement #type system #verification: Relatively complete refinement type system for verification of higher-order non-deterministic programs (HU0, YS, TT), p. 29.
POPL-2018-AgrawalC0 #approach #performance #probability #ranking #termination: Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (SA, KC, PN0), p. 32.
POPL-2018-BaoKPS #behaviour #modelling: Analytical modeling of cache behavior for affine programs (WB, SK, LNP, PS), p. 26.
POPL-2018-BartheEGHS #probability #proving: Proving expected sensitivity of probabilistic programs (GB, TE, BG, JH, PYS), p. 29.
POPL-2018-LiY #algorithm #analysis #problem #quantum #termination: Algorithmic analysis of termination problems for quantum programs (YL, MY), p. 29.
POPL-2018-MeloRAP #c #semantics: Inference of static semantics for incomplete C programs (LTCM, RGR, MRdA, FMQP), p. 28.
POPL-2018-NguyenGTH #contract #higher-order #verification: Soft contract verification for higher-order stateful programs (PCN, TG, STH, DVH), p. 30.
PPDP-2018-Hanus #declarative #verification: Verifying Fail-Free Declarative Programs (MH), p. 13.
PPDP-2018-KlemenS0MH #performance #runtime: Static Performance Guarantees for Programs with Runtime Checks (MK, NS, PLG0, JFM, MVH), p. 13.
PPDP-2018-SulzmannS #dynamic analysis #message passing: Two-Phase Dynamic Analysis of Message-Passing Go Programs Based on Vector Clocks (MS, KS), p. 13.
SAS-2018-AlurDS #gpu #independence: Block-Size Independence for GPU Programs (RA, JD, NS), pp. 107–126.
SAS-2018-HuckelheimLNSH #verification: Verifying Properties of Differentiable Programs (JH, ZL, SHKN, SFS, PDH), pp. 205–222.
SAS-2018-JournaultMO #c #composition #static analysis #string: Modular Static Analysis of String Manipulations in C Programs (MJ, AM, AO), pp. 243–262.
ASE-2018-ChenZ #framework #retrieval #summary: A neural framework for retrieval and summarization of source code (QC, MZ), pp. 826–831.
ASE-2018-Cosmo: Software heritage: collecting, preserving, and sharing all our source code (keynote) (RDC), pp. 1–2.
ASE-2018-GharibiTL #automation #generative #graph #named #python: Code2graph: automatic generation of static call graphs for Python source code (GG, RT, YL), pp. 880–883.
ASE-2018-HaririS #c #mutation testing #named #representation #testing #tool support: SRCIROR: a toolset for mutation testing of C source code and LLVM intermediate representation (FH, AS), pp. 860–863.
ASE-2018-MonteiroGCF #bound #c++ #framework #model checking #platform: Bounded model checking of C++ programs based on the Qt cross-platform framework (journal-first abstract) (FRM, MAPG, LCC, EBdLF), p. 954.
ASE-2018-OzdemirTEA #lightweight #monitoring: Lightweight source code monitoring with Triggr (AO, AT, HE, RA), pp. 864–867.
ASE-2018-SungLEW #concurrent #difference #scalability #semantics: Datalog-based scalable semantic diffing of concurrent programs (CS, SKL, CE, CW0), pp. 656–666.
ASE-2018-WanZYXY0Y #automation #learning #summary: Improving automatic source code summarization via deep reinforcement learning (YW, ZZ, MY0, GX, HY, JW0, PSY), pp. 397–407.
ESEC-FSE-2018-Chen00M0 #concurrent #parallel #testing #thread: Testing multithreaded programs via thread speed control (DC, YJ0, CX0, XM, JL0), pp. 15–25.
ESEC-FSE-2018-HashimotoMI #automation #debugging #semantics: Automated patch extraction via syntax- and semantics-aware Delta debugging on source code changes (MH, AM, TI), pp. 598–609.
ESEC-FSE-2018-HenkelLLR #comprehension #embedded: Code vectors: understanding programs through embedded abstracted symbolic traces (JH, SKL, BL, TWR), pp. 163–174.
ESEC-FSE-2018-SiLZAKN #datalog #synthesis: Syntax-guided synthesis of Datalog programs (XS, WL, RZ, AA, PK, MN), pp. 515–527.
ICSE-2018-BankenMG #data flow #debugging: Debugging data flows in reactive programs (HB, EM0, GG), pp. 752–763.
ICSE-2018-KimCK #c #precise #testing #using: Precise concolic unit testing of C programs using extended units and symbolic alarm filtering (YK, YC, MK), pp. 315–326.
ICSE-2018-KrugerWFSL #question: Do you remember this source code? (JK, JW, WF, GS, TL), pp. 764–775.
ICSE-2018-SousaOOBGLKMFOL #design #identification #problem: Identifying design problems in the source code: a grounded theory (LdSS, AO, WNO, SDJB, AG, JL, MK, RMdM, BF, RFO, CL, RBdP), pp. 921–931.
GPCE-2018-ChristopheRBM #analysis #distributed #javascript #process: Orchestrating dynamic analyses of distributed processes for full-stack JavaScript programs (LC, CDR, EGB, WDM), pp. 107–118.
GPCE-2018-HatchF #interactive #named #reliability: Rash: from reckless interactions to reliable programs (WGH, MF), pp. 28–39.
ASPLOS-2018-RajaduraiBWA #configuration management #named: Gloss: Seamless Live Reconfiguration and Reoptimization of Stream Programs (SR, JB, WFW, SPA), pp. 98–112.
ASPLOS-2018-RiggerSMGM #c #debugging #execution #fault: Sulong, and Thanks for All the Bugs: Finding Errors in C Programs by Abstracting from the Native Execution Model (MR, RS, RM, MG, HM), pp. 377–391.
CASE-2018-StutzM #automation #design #development #how #object-oriented #process: How object-oriented design principles enhance the development of complex automation programs - A Best Practice Paper on how to develop service-interlaces for process modules as defined in VDI/VDE/NAMUR 2658 (AS, MM), pp. 156–159.
CC-2018-ColinL #composition #termination: Termination checking and task decomposition for task-based intermittent programs (AC, BL), pp. 116–127.
CGO-2018-ToffolaPG #performance: Synthesizing programs that expose performance bottlenecks (LDT, MP, TRG), pp. 314–326.
ESOP-2018-BartheEGGHS #logic #probability: An Assertion-Based Program Logic for Probabilistic Programs (GB, TE, MG, BG, JH, PYS), pp. 117–144.
ESOP-2018-BichselGV #fine-grained #probability #semantics: Fine-Grained Semantics for Probabilistic Programs (BB, TG, MTV), pp. 145–185.
ESOP-2018-EilersMH #composition: Modular Product Programs (ME, PM0, SH), pp. 502–529.
FASE-2018-LandsbergSK #fault #locality #optimisation #specification #using: Optimising Spectrum Based Fault Localisation for Single Fault Programs Using Specifications (DL, YS, DK), pp. 246–263.
CAV-2018-BansalNS #specification #synthesis: Synthesis of Asynchronous Reactive Programs from Temporal Specifications (SB, KSN, YS), pp. 367–385.
CAV-2018-KraglQ #concurrent: Layered Concurrent Programs (BK, SQ), pp. 79–102.
CAV-2018-Satake0 #functional #higher-order #logic: Propositional Dynamic Logic for Higher-Order Functional Programs (YS, HU0), pp. 105–123.
CAV-2018-Yahav #modelling: From Programs to Interpretable Deep Models and Back (EY), pp. 27–37.
CAV-2018-ArndtJKMN #exclamation #graph #java #pointer #verification: Let this Graph Be Your Witness! - An Attestor for Verifying Java Pointer Programs (HA, CJ, JPK, CM, TN0), pp. 3–11.
CAV-2018-BouajjaniEJQ #bound #message passing #on the #verification: On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony (AB, CE, KJ, SQ), pp. 372–391.
CAV-2018-BouajjaniEMT #abstraction #reasoning #reduction #using: Reasoning About TSO Programs Using Reduction and Abstraction (AB, CE, SOM, ST), pp. 336–353.
CAV-2018-DohrauSUM0 #array: Permission Inference for Array Programs (JD, AJS, CU, SM, PM0), pp. 55–74.
ICST-2018-KimHKPK #test coverage #testing: Invasive Software Testing: Mutating Target Programs to Diversify Test Exploration for High Test Coverage (YK, SH, BK, DLP, MK), pp. 239–249.
IJCAR-2018-KotelnikovKV #encoding #imperative: A FOOLish Encoding of the Next State Relations of Imperative Programs (EK, LK, AV), pp. 405–421.
IJCAR-2018-ZhanH #complexity #imperative #verification: Verifying Asymptotic Time Complexity of Imperative Programs in Isabelle (BZ, MPLH), pp. 532–548.
VMCAI-2018-BaumannDMHV #abstraction #automation #verification: Automatic Verification of RMA Programs via Abstraction Extrapolation (CB, AMD, YM, TH, MTV), pp. 47–70.
VMCAI-2018-BiondiEHLMQ #approximate #data flow #scalability: Scalable Approximation of Quantitative Information Flow in Programs (FB, MAE, AH, AL, KSM, JQ), pp. 71–93.
VMCAI-2018-TitoloFMM #abstract interpretation #analysis #fault #float #framework: An Abstract Interpretation Framework for the Round-Off Error Analysis of Floating-Point Programs (LT, MAF, MMM, CAM), pp. 516–537.
ICSA-2017-ZhengCA #architecture #consistency #product line #traceability: Mapping Features to Source Code through Product Line Architecture: Traceability and Conformance (YZ, CC, HUA), pp. 225–234.
CSEET-2017-SaiedianLW #how #question #re-engineering: CSEE&T 2017 Panel Proposal How to Enhance Diversity in Software Engineering Programs? (HS, GAL, ABW), pp. 122–123.
CSEET-2017-TaylorGKWVC #re-engineering: Undergraduate Software Engineering Programs (CT, KG, JK, CW, NMV, LC), pp. 180–181.
ICSME-2017-BaumSB #on the #order #overview #perspective: On the Optimal Order of Reading Source Code Changes for Review (TB, KS, AB), pp. 329–340.
ICSME-2017-YiCMJ #automation: Automated Repair of High Inaccuracies in Numerical Programs (XY, LC, XM, TJ), pp. 514–518.
MSR-2017-AivaloglouHMR #dataset: A dataset of scratch programs: scraped, shaped and scored (EA, FH, JML, GR), pp. 511–514.
SANER-2017-BartmanNCM #named #query: srcQL: A syntax-aware query language for source code (BB, CDN, MLC, JIM), pp. 467–471.
SANER-2017-GhafariM #framework #recommendation: A framework for classifying and comparing source code recommendation systems (MG, HM), pp. 555–556.
SANER-2017-NewmanACM #category theory #identifier: Lexical categories for source code identifiers (CDN, RSA, MLC, JIM), pp. 228–239.
SANER-2017-ProkschNAM #fine-grained #process: Enriching in-IDE process information with fine-grained source code history (SP, SN, SA, MM), pp. 250–260.
SANER-2017-SantosPAEMD #recommendation: Recommending source code locations for system specific transformations (GS, KVRP, NA, AE, MdAM, SD), pp. 160–170.
SCAM-2017-NashaatAM #detection #object-oriented #php #security: Detecting Security Vulnerabilities in Object-Oriented PHP Programs (MN, KA0, JM0), pp. 159–164.
SCAM-2017-RuizCM #detection: Working Around Loops for Infeasible Path Detection in Binary Programs (JR, HC, MDM), pp. 1–10.
SCAM-2017-SzalayPK #c #c++ #clustering #towards: Towards Better Symbol Resolution for C/C++ Programs: A Cluster-Based Solution (RS, ZP, DK), pp. 101–110.
FSCD-2017-Gaboardi #higher-order #relational #type system #verification: Type Systems for the Relational Verification of Higher Order Programs (Invited Talk) (MG), p. 1.
ICFP-2017-AguirreBG0S #higher-order #logic #relational: A relational logic for higher-order programs (AA0, GB, MG, DG0, PYS), p. 29.
ICFP-2017-NarayananS #array #probability: Symbolic conditioning of arrays in probabilistic programs (PN, CcS), p. 25.
ICFP-2017-RicciottiSPC #functional #imperative: Imperative functional programs that explain their work (WR, JS, RP, JC), p. 28.
ICML-2017-GauntBKT #library: Differentiable Programs with Neural Libraries (ALG, MB, NK, DT), pp. 1213–1222.
ICML-2017-LevyW #learning: Learning to Align the Source Code to the Compiled Object Code (DL, LW), pp. 2043–2051.
ECOOP-2017-DietrichPJBD #case study #contract #java: Contracts in the Wild: A Study of Java Programs (JD0, DJP, KJ, PB), p. 29.
ECOOP-2017-StievenartNMR #abstraction #static analysis: Mailbox Abstractions for Static Analysis of Actor Programs (QS, JN, WDM, CDR), p. 30.
OOPSLA-2017-BakstGKJ #canonical #distributed #verification: Verifying distributed programs via canonical sequentialization (AB, KvG, RGK, RJ), p. 27.
OOPSLA-2017-CogumbreiroSMSV #concurrent #parallel #why: Deadlock avoidance in parallel programs with futures: why parallel tasks should not wait for strangers (TC, RS, FM, VS, VTV, MG), p. 26.
OOPSLA-2017-LiZ #fault #locality #testing: Transforming programs and tests in tandem for fault localization (XL, LZ), p. 30.
OOPSLA-2017-YuanMJ: Abridging source code (BY, VM, CMJ), p. 26.
LOPSTR-2017-NguyenT #analysis #parallel #thread: CARET Analysis of Multithreaded Programs (HVN, TT), pp. 73–90.
PADL-2017-AntoyH #functional #logic programming #nondeterminism: Eliminating Irrelevant Non-determinism in Functional Logic Programs (SA, MH), pp. 1–18.
PADL-2017-Redl #set: Extending Answer Set Programs with Interpreted Functions as First-Class Citizens (CR), pp. 68–85.
PLDI-2017-EizenbergPPMD #analysis #named #runtime: BARRACUDA: binary-level analysis of runtime RAces in CUDA programs (AE, YP, TP, WM, JD), pp. 126–140.
PLDI-2017-FedyukovichAB #parallel #synthesis: Gradual synthesis for static parallelization of single-pass array-processing programs (GF, MBSA, RB), pp. 572–585.
PLDI-2017-LifflanderK #locality #optimisation #recursion: Cache locality optimization for recursive programs (JL, SK), pp. 1–16.
PLDI-2017-SanthiarK #c# #concurrent #detection: Static deadlock detection for asynchronous C# programs (AS, AK), pp. 292–305.
POPL-2017-BartheGHS #probability #proving: Coupling proofs are probabilistic product programs (GB, BG, JH, PYS), pp. 161–174.
POPL-2017-YingYW #generative #invariant #quantum: Invariants of quantum programs: characterisations and generation (MY, SY, XW), pp. 818–832.
PPDP-2017-Huisman #parallel #verification: A verification technique for deterministic parallel programs (MH), p. 3.
SAS-2017-BouajjaniEL #concurrent #difference #evolution #semantics: Abstract Semantic Diffing of Evolving Concurrent Programs (AB, CE, SKL), pp. 46–65.
SAS-2017-ChakrabortyGU #array #verification: Verifying Array Manipulating Programs by Tiling (SC, AG, DU), pp. 428–449.
SAS-2017-GurfinkelN #c #c++ #memory management #verification: A Context-Sensitive Memory Model for Verification of C/C++ Programs (AG, JAN), pp. 148–168.
SAS-2017-MukherjeePSDR #abstraction #performance #semantics #thread: Thread-Local Semantics and Its Efficient Sequential Abstractions for Race-Free Programs (SM, OP, SS, DD, NR), pp. 253–276.
SAS-2017-SoO #imperative #static analysis: Synthesizing Imperative Programs from Examples Guided by Static Analysis (SS, HO), pp. 364–381.
SAS-2017-ZhangSX #analysis #incremental #probability: Incremental Analysis for Probabilistic Programs (JZ, YS, JX), pp. 450–472.
ASE-2017-LinZZX #concept #retrieval #using: Improving software text retrieval using conceptual knowledge in source code (ZL, YZ, JZ, BX), pp. 123–134.
ASE-2017-MetzlerSBS #concurrent #scheduling #verification: Quick verification of concurrent programs by iteratively relaxed scheduling (PM, HS, PB, NS), pp. 776–781.
ASE-2017-NguyenS0TP #concurrent #parallel: Parallel bug-finding in concurrent programs via reduced interleaving instances (TLN, PS, BF0, SLT, GP), pp. 753–764.
ESEC-FSE-2017-GopsteinIYDZYC #comprehension: Understanding misunderstandings in source code (DG, JI, YY, LD, YZ, MKCY, JC), pp. 129–139.
ESEC-FSE-2017-HellendoornD #modelling #network #question: Are deep neural networks the best choice for modeling source code? (VJH, PTD), pp. 763–773.
ESEC-FSE-2017-YogaN #parallel #performance #profiling: A fast causal profiler for task parallel programs (AY, SN), pp. 15–26.
ICSE-2017-ChenBHXZX #compilation #learning #testing: Learning to prioritize test programs for compiler testing (JC0, YB, DH, YX, HZ0, BX), pp. 700–711.
ICSE-2017-GopalakrishnanS #architecture #predict #question #topic: Can latent topics in source code predict missing architectural tactics? (RG, PS, MM, MG), pp. 15–26.
SLE-2017-ShenR #robust: Robust programs with filtered iterators (JS, MR), pp. 244–255.
ASPLOS-2017-NguyenP #memory management #scalability #transaction #what: What Scalable Programs Need from Transactional Memory (DN, KP), pp. 105–118.
CC-2017-TownsendKE #data flow #functional #pipes and filters: From functional programs to pipelined dataflow circuits (RT, MAK, SAE), pp. 76–86.
ESOP-2017-0001P #syntax #using: Programs Using Syntax with First-Class Binders (FF0, BP), pp. 504–529.
ESOP-2017-BouajjaniEEOT #concurrent #robust #verification: Verifying Robustness of Event-Driven Asynchronous Programs Against Concurrency (AB, ME, CE, BKO, ST), pp. 170–200.
ESOP-2017-CulpepperC #equivalence #probability #random: Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring (RC, AC), pp. 368–392.
ESOP-2017-DArgenioBBFH #analysis #formal method: Is Your Software on Dope? - Formal Analysis of Surreptitiously “enhanced” Programs (PRD, GB, SB, BF, HH), pp. 83–110.
ESOP-2017-Sato0 #composition #functional #higher-order #verification: Modular Verification of Higher-Order Functional Programs (RS, NK0), pp. 831–854.
CADE-2017-SantosGMN #javascript #towards #verification: Towards Logic-Based Verification of JavaScript Programs (JFS, PG, PM, DN), pp. 8–25.
CADE-2017-TellezB #automation #pointer #proving #verification: Automatically Verifying Temporal Properties of Pointer Programs with Cyclic Proof (GT, JB), pp. 491–508.
CAV-2017-AlbarghouthiDD #nondeterminism: Repairing Decision-Making Programs Under Uncertainty (AA, LD, SD), pp. 181–200.
CAV-2017-AlurDLS #detection #gpu #named: GPUDrano: Detecting Uncoalesced Accesses in GPU Programs (RA, JD, OSNL, NS), pp. 507–525.
CAV-2017-ChasinsP #data-driven #probability #synthesis: Data-Driven Synthesis of Full Probabilistic Programs (SC, PMP), pp. 279–304.
CAV-2017-ChatterjeeFG #analysis #recursion #worst-case: Non-polynomial Worst-Case Analysis of Recursive Programs (KC, HF0, AKG), pp. 41–63.
CAV-2017-GrossmanCIRS #equivalence #verification: Verifying Equivalence of Spark Programs (SG, SC, SI, NR, MS), pp. 282–300.
CAV-2017-McClurgHC #network #synthesis: Synchronization Synthesis for Network Programs (JM, HH, PC), pp. 301–321.
ICST-2017-ChanWSPS #analysis #concurrent #fault #invariant #multi #named #thread #using: IPA: Error Propagation Analysis of Multi-Threaded Programs Using Likely Invariants (AC, SW0, HS, KP, NS), pp. 184–195.
ICST-2017-DiasFFLSSV #concurrent #contract #using #verification: Verifying Concurrent Programs Using Contracts (RJD, CF0, JF, JML, AS, DGS, TV), pp. 196–206.
ICST-2017-ZhangYZLCHL #automation #data flow #parallel #testing #thread: Automated Testing of Definition-Use Data Flow for Multithreaded Programs (XZ0, ZY, QZ, PL, JC, YH, TL0), pp. 172–183.
VMCAI-2017-AbalBW #abstraction #c #debugging #effectiveness: Effective Bug Finding in C Programs with Shape and Effect Abstractions (IA, CB, AW), pp. 34–54.
VMCAI-2017-GuW #analysis #float #using: Stabilizing Floating-Point Programs Using Provenance Analysis (YG, TW), pp. 228–245.
VMCAI-2017-MonatM #abstract interpretation #abstraction #concurrent #precise #relational #thread #using: Precise Thread-Modular Abstract Interpretation of Concurrent Programs Using Relational Interference Abstractions (RM, AM), pp. 386–404.
ECSA-2016-AlsharaSTBDS #architecture #component #object-oriented: Materializing Architecture Recovered from Object-Oriented Source Code in Component-Based Languages (ZA, ADS, CT, HLB, CD, AS), pp. 309–325.
ECSA-2016-KaptoEKT #analysis #approach #architecture #detection #evolution: Inferring Architectural Evolution from Source Code Analysis - A Tool-Supported Approach for the Detection of Architectural Tactics (CK, GEB, SK, CT), pp. 149–165.
QoSA-2016-FreibergPE #communication #distributed: Retargetable Communication for Distributed Programs (OF, JP, ME), pp. 21–30.
ICPC-2016-BreckelT #programming: Embedding programming context into source code (AB, MT), pp. 1–4.
ICPC-2016-HermansA #empirical #programming #smell: Do code smells hamper novice programming? A controlled experiment on Scratch programs (FH, EA), pp. 1–10.
ICPC-2016-Kulkarni #reuse #scalability: Comprehending source code of large software system for reuse (AK), pp. 1–4.
ICPC-2016-SunSYL #named #word: WB4SP: A tool to build the word base for specific programs (WS, XS, HY, BL0), pp. 1–3.
ICSME-2016-CollardM #semiparsing: srcML 1.0: Explore, Analyze, and Manipulate Source Code (MLC, JIM), p. 649.
ICSME-2016-CruzMM #component #summary: TraceLab Components for Reproducing Source Code Summarization Experiments (BDC, PWM, CM), p. 610.
ICSME-2016-KirchmayrMNPT #analysis #comprehension #integration #legacy: Integration of Static and Dynamic Code Analysis for Understanding Legacy Source Code (WK, MM, LN, JP, RT), pp. 543–552.
ICSME-2016-LinCMC0X #empirical #fine-grained #python: An Empirical Study on the Characteristics of Python Fine-Grained Source Code Change Types (WL, ZC, WM, LC0, LX0, BX), pp. 188–199.
ICSME-2016-NguyenNN #fine-grained #topic #using: Using Topic Model to Suggest Fine-Grained Source Code Changes (HAN, ATN0, TNN), pp. 200–210.
ICSME-2016-NguyenTN #migration #question #statistics: Do Contexts Help in Phrase-Based, Statistical Source Code Migration? (ATN0, ZT, TNN), pp. 155–165.
ICSME-2016-RahimiC #feature model #matrix #named: Artifact: Cassandra Source Code, Feature Descriptions across 27 Versions, with Starting and Ending Version Trace Matrices (MR, JCH), p. 612.
ICSME-2016-Smith #validation: Resolving Input Validation Vulnerabilities by Retracing Taint Flow Through Source Code (JS0), p. 617.
MSR-2016-DiamantopoulosT #component #named #recommendation #usability: QualBoa: reusability-aware recommendations of source code components (TGD, KT, ALS), pp. 488–491.
SANER-2016-BorckBSHHJSS #named #using: Frankencode: Creating Diverse Programs Using Code Clones (HB, MSB, IJDS, SAH, KH, SJ, AS, MS), pp. 604–608.
SANER-2016-KarasnehCKG #anti #design #modelling: Studying the Relation between Anti-Patterns in Design Models and in Source Code (BK, MRVC, FK, YGG), pp. 36–45.
SANER-2016-MachoMP #category theory #commit #predict: Predicting Build Co-changes with Source Code Change and Commit Categories (CM, SM, MP0), pp. 541–551.
SANER-2016-TengeriHBGG #bytecode #java #test coverage: Negative Effects of Bytecode Instrumentation on Java Source Code Coverage (DT, FH, ÁB, TG, TG), pp. 225–235.
SANER-2016-WeckT #functional #visualisation: Visualizing Data-Flows in Functional Programs (TW, MT), pp. 293–303.
SANER-2016-YeZMYZ #javascript #performance #precise #slicing: Efficient and Precise Dynamic Slicing for Client-Side JavaScript Programs (JY, CZ, LM0, HY0, JZ), pp. 449–459.
SCAM-2016-BlanchardKLL #c #composition #named #parallel #plugin #verification: Conc2Seq: A Frama-C Plugin for Verification of Parallel Compositions of C Programs (AB, NK, ML, FL), pp. 67–72.
SCAM-2016-Ragkhitwetsagul #pervasive #similarity: Similarity of Source Code in the Presence of Pervasive Modifications (CR, JK, DC), pp. 117–126.
SCAM-2016-ViticchieRTBCTT #assessment #obfuscation: Assessment of Source Code Obfuscation Techniques (AV, LR, MT, CB, MC, PT, RT), pp. 11–20.
FM-2016-DjoudiBG: Recovering High-Level Conditions from Binary Programs (AD, SB, ÉG), pp. 235–253.
FM-2016-Flores-Montoya #bound: Upper and Lower Amortized Cost Bounds of Programs Expressed as Cost Relations (AFM), pp. 254–273.
FSCD-2016-BenkeSC #first-order #functional #logic #synthesis: Synthesis of Functional Programs with Help of First-Order Intuitionistic Logic (MB, AS, DWC), p. 16.
IFM-2016-Preoteasa #invariant #logic #pointer #programming #using #verification: Verifying Pointer Programs Using Separation Logic and Invariant Based Programming in Isabelle (VP), pp. 457–473.
SEFM-2016-HenselGFS #execution #proving #symbolic computation #termination: Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution (JH, JG, FF, TS), pp. 234–252.
ICFP-2016-RaghunathanMAB #memory management #parallel: Hierarchical memory management for parallel programs (RR, SKM, UAA, GEB), pp. 392–406.
ICFP-2016-SeidelJW #fault #static typing: Dynamic witnesses for static type errors (or, ill-typed programs usually go wrong) (ELS, RJ, WW), pp. 228–242.
ICFP-2016-UenoO #concurrent #functional #garbage collection #manycore: A fully concurrent garbage collector for functional programs on multicore processors (KU, AO), pp. 421–433.
ICFP-2016-WatanabeST0 #automation #functional #higher-order #termination: Automatically disproving fair termination of higher-order functional programs (KW, RS, TT, NK0), pp. 243–255.
DiGRA-FDG-2016-Willumsen #analysis #formal method: Source Code and Formal Analysis: A Hermeneutic Reading of Passage (ECW).
ICML-2016-AllamanisPS #network #summary: A Convolutional Attention Network for Extreme Summarization of Source Code (MA, HP, CAS), pp. 2091–2100.
SKY-2016-Speicher16a #mining: Mining Source Code Regularities with FCA and Association Rules (DS), pp. 75–77.
ECOOP-2016-Chevalier-Boisvert #analysis #interprocedural #javascript: Interprocedural Type Specialization of JavaScript Programs Without Type Analysis (MCB, MF), p. 24.
ECOOP-2016-WangJLXLZH #api: Transforming Programs between APIs with Many-to-Many Mappings (CW, JJ, JL, YX, XL, LZ0, ZH), p. 26.
Onward-2016-Emerich #how: How are programs found? speculating about language ergonomics with Curry-Howard (JE), pp. 212–223.
Onward-2016-MarterBLH #identifier #lightweight #programming #readability #similarity #using: Lightweight programming experiments without programmers and programs: an example study on the effect of similarity and number of object identifiers on the readability of source code using natural texts (TM, PB, PL, SH), pp. 1–14.
OOPSLA-2016-ColinL #named #reliability: Chain: tasks and channels for reliable intermittent programs (AC, BL), pp. 514–530.
OOPSLA-2016-SteimannHU #attribute grammar #constraints #using: Computing repair alternatives for malformed programs using constraint attribute grammars (FS, JH, BU), pp. 711–730.
LOPSTR-2016-AlpuenteCEM #axiom #equation #order #partial evaluation: Partial Evaluation of Order-Sorted Equational Programs Modulo Axioms (MA, ACO, SE, JM), pp. 3–20.
LOPSTR-2016-FalaschiGOP #concurrent #constraints #slicing: Slicing Concurrent Constraint Programs (MF, MG, CO, CP), pp. 76–93.
LOPSTR-2016-Hanus #named: CurryCheck: Checking Properties of Curry Programs (MH), pp. 222–239.
LOPSTR-2016-JanaKDVC #array #bound #model checking #scalability: Scaling Bounded Model Checking by Transforming Programs with Arrays (AJ, UPK, AD, RV, NC), pp. 275–292.
LOPSTR-2016-MesnardPV #logic programming #on the #testing #unification: On the Completeness of Selective Unification in Concolic Testing of Logic Programs (FM, ÉP, GV), pp. 205–221.
LOPSTR-2016-MorenoPRV #execution #fuzzy #logic programming #symbolic computation: Symbolic Execution and Thresholding for Efficiently Tuning Fuzzy Logic Programs (GM, JP, JAR, GV), pp. 131–147.
PADL-2016-CaretteS #algebra #probability #using: Simplifying Probabilistic Programs Using Computer Algebra (JC, CcS), pp. 135–152.
PLDI-2016-CostanzoSG #assembly #c #data flow #security #verification: End-to-end verification of information-flow security for C and assembly programs (DC, ZS, RG), pp. 648–664.
POPL-2016-BaoKPRS #named #verification: PolyCheck: dynamic verification of iteration space transformations on affine programs (WB, SK, LNP, FR, PS), pp. 539–554.
POPL-2016-ChatterjeeFNH #algorithm #analysis #probability #problem #termination: Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (KC, HF0, PN0, RH), pp. 327–342.
POPL-2016-MuraseT0SU #functional #higher-order #verification: Temporal verification of higher-order functional programs (AM, TT, NK0, RS, HU0), pp. 57–68.
POPL-2016-RaychevBVK #learning #semistructured data: Learning programs from noisy data (VR, PB, MTV, AK0), pp. 761–774.
PPDP-2016-Benton0N #concurrent: Effect-dependent transformations for concurrent programs (NB, MH0, VN), pp. 188–201.
SAS-2016-JournaultM #abstract interpretation #correctness #functional #matrix #static analysis: Static Analysis by Abstract Interpretation of the Functional Correctness of Matrix Manipulating Programs (MJ, AM), pp. 257–277.
SAS-2016-MonniauxG #array #horn clause: Cell Morphing: From Array Programs to Array-Free Horn Clauses (DM, LG), pp. 361–382.
ASE-2016-CaiT #distributed #effectiveness #impact analysis #named: DistIA: a cost-effective dynamic impact analysis for distributed programs (HC, DT), pp. 344–355.
ASE-2016-DotzlerP #difference: Move-optimized source code tree differencing (GD, MP), pp. 660–671.
ASE-2016-PeldszusKLS #design #detection #evolution #incremental #multi #object-oriented #pattern matching #using: Continuous detection of design flaws in evolving object-oriented programs using incremental multi-pattern matching (SP, GK, ML, SS), pp. 578–589.
FSE-2016-BraioneDP #java #named: JBSE: a symbolic executor for Java programs with complex heap inputs (PB, GD, MP), pp. 1018–1022.
FSE-2016-Quan #execution #float #symbolic computation: Hotspot symbolic execution of floating-point programs (MQ), pp. 1112–1114.
FSE-2016-YogaNG #concurrent #detection #parallel: Parallel data race detection for task parallel programs with locks (AY, SN, AG), pp. 833–845.
FSE-2016-YoshidaTPGU #c #c++ #fine-grained #generative #incremental #named #testing: FSX: a tool for fine-grained incremental unit test generation for C/C++ programs (HY, ST, MRP, IG, TU), pp. 1052–1056.
ICSE-2016-DhokRS #javascript #testing: Type-aware concolic testing of JavaScript programs (MD, MKR, NS0), pp. 168–179.
ASPLOS-2016-SuiLFP #approximate: Proactive Control of Approximate Programs (XS, AL, DSF, KP), pp. 607–621.
CC-2016-KoukosEZSKJ #compilation #energy #multi: Multiversioned decoupled access-execute: the key to energy-efficient compilation of general-purpose programs (KK, PE, GZ, VS, SK, AJ), pp. 121–131.
CGO-2016-ChakrabortyV #c #c++ #concurrent #optimisation #validation: Validating optimizations of concurrent C/C++ programs (SC, VV), pp. 216–226.
CGO-2016-SuiDX #analysis #parallel #pointer #thread: Sparse flow-sensitive pointer analysis for multithreaded programs (YS, PD, JX), pp. 160–170.
CGO-2016-YogaN #parallel: Atomicity violation checker for task parallel programs (AY, SN), pp. 239–249.
ESOP-2016-KaminskiKMO #probability #reasoning: Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs (BLK, JPK, CM, FO), pp. 364–389.
ESOP-2016-MineBR #algorithm #constraints #induction #invariant #theorem proving: An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs (AM, JB, TWR), pp. 560–588.
ESOP-2016-Summers0 #composition #message passing #verification: Actor Services - Modular Verification of Message Passing Programs (AJS, PM0), pp. 699–726.
ESOP-2016-WangN #approach #functional #higher-order #syntax: A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs (YW, GN), pp. 752–779.
FASE-2016-CorrodiHP #concurrent #graph #semantics: A Graph-Based Semantics Workbench for Concurrent Asynchronous Programs (CC, AH, CMP), pp. 31–48.
CAV-2016-ChatterjeeFG #analysis #probability #termination: Termination Analysis of Probabilistic Programs Through Positivstellensatz's (KC, HF0, AKG), pp. 3–22.
CAV-2016-GehrMV #named #probability: PSI: Exact Symbolic Inference for Probabilistic Programs (TG, SM, MTV), pp. 62–83.
CAV-2016-KahsaiRSS #framework #java #named #verification: JayHorn: A Framework for Verifying Java programs (TK, PR, HS, MS), pp. 352–358.
CAV-2016-LeSC #satisfiability: Satisfiability Modulo Heap-Based Programs (QLL, JS0, WNC), pp. 382–404.
CAV-2016-ChistikovMN #product line: Hitting Families of Schedules for Asynchronous Programs (DC, RM, FN), pp. 157–176.
CSL-2016-Berger #concurrent #nondeterminism: Extracting Non-Deterministic Concurrent Programs (UB0), p. 21.
ICST-2016-ChengWXH0 #empirical #evaluation #functional #test coverage: Empirical Evaluation of Test Coverage for Functional Programs (YC, MW0, YX, DH, LZ0), pp. 255–265.
ICST-2016-LiewCD #execution #named #symbolic computation: Symbooglix: A Symbolic Execution Engine for Boogie Programs (DL, CC, AFD), pp. 45–56.
ICST-2016-YuWHH #concurrent #predict #testing: Predicting Testability of Concurrent Programs (TY, WW, XH, JHH), pp. 168–179.
ICTSS-2016-CollavizzaMR #float: Searching Critical Values for Floating-Point Programs (HC, CM, MR), pp. 209–217.
IJCAR-2016-FrohnNHBG #bound #integer #runtime: Lower Runtime Bounds for Integer Programs (FF, MN, JH, MB, JG), pp. 550–567.
IJCAR-2016-HupelK #higher-order #scala: Translating Scala Programs to Isabelle/HOL - System Description (LH, VK), pp. 568–577.
VMCAI-2016-Parizek #analysis #array #hybrid #partial order #reduction: Hybrid Analysis for Partial Order Reduction of Programs with Arrays (PP), pp. 291–310.
CBSE-2015-RuchkinSG #abstraction #architecture #hybrid: Architectural Abstractions for Hybrid Programs (IR, BRS, DG), pp. 65–74.
VLDB-2015-DeutchGM #datalog #query #using: Selective Provenance for Datalog Programs Using Top-K Queries (DD, AG, YM), pp. 1394–1405.
ITiCSE-2015-BergesH #evaluation: Evaluation of Source Code with Item Response Theory (MB, PH), pp. 51–56.
ITiCSE-2015-Harms #community #learning: Department Programs to Encourage and Support Service Learning and Community Engagement (DEH), p. 330.
SIGITE-2015-MacKellarHSS #how #question: Information Technology and Computer Science Programs: How Do We Relate? (BM, GWH, MS, AS), pp. 125–126.
SCAM-J-2013-MarcozziVH15 #database #execution #relational #sql #symbolic computation #testing: Relational symbolic execution of SQL code for unit testing of database programs (MM, WV, JLH), pp. 44–72.
ICPC-2015-JordanRHBB #feature model #industrial: Manually locating features in industrial source code: the search actions of software nomads (HRJ, JR, SH, GB, JB), pp. 174–177.
ICPC-2015-SaeidiHKJ #analysis #interactive #modelling #named #topic: ITMViz: interactive topic modeling for source code analysis (AS, JH, RK, SJ), pp. 295–298.
ICPC-2015-SaiedABS #api #library #question #using: Could we infer unordered API usage patterns only using the library source code? (MAS, HA, OB, HAS), pp. 71–81.
ICSME-2015-SantosAEDV #program transformation: System specific, source code transformations (GS, NA, AE, SD, MTV), pp. 221–230.
MSR-2015-DiamantopoulosS #stack overflow: Employing Source Code Information to Improve Question-Answering in Stack Overflow (TGD, ALS), pp. 454–457.
MSR-2015-JiangA #co-evolution #empirical #framework: Co-evolution of Infrastructure and Source Code — An Empirical Study (YJ, BA), pp. 45–55.
MSR-2015-LabuschagneH #question: Do Onboarding Programs Work? (AL, RH), pp. 381–385.
MSR-2015-SinhaSDPM #detection #repository: Detecting and Mitigating Secret-Key Leaks in Source Code Repositories (VSS, DS, PD, RP, SM), pp. 396–400.
MSR-2015-Zacchiroli #dataset #metadata: The Debsources Dataset: Two Decades of Debian Source Code Metadata (SZ), pp. 466–469.
SANER-2015-HashimotoMI #fine-grained #scalability: A comprehensive and scalable method for analyzing fine-grained source code change patterns (MH, AM, TI), pp. 351–360.
SANER-2015-WongLT #automation #generative #mining #named: CloCom: Mining existing source code for automatic comment generation (EW, TL, LT), pp. 380–389.
SCAM-2015-BaloghSB #eclipse #named: CodeMetropolis: Eclipse over the city of source code (GB, AS, ÁB), pp. 271–276.
SCAM-2015-BrandtnerLG #dependence #integration #testing: Intent, tests, and release dependencies: Pragmatic recipes for source code integration (MB, PL, HCG), pp. 11–20.
SCAM-2015-LawrieB #navigation #word: Navigating source code with words (DL, DB), pp. 71–80.
SCAM-2015-RahmanRK #crowdsourcing #recommendation #using: Recommending insightful comments for source code using crowdsourced knowledge (MMR, CKR, IK), pp. 81–90.
SCAM-2015-SantosEADV #game studies #program transformation: Recording and replaying system specific, source code transformations (GS, AE, NA, SD, MTV), pp. 221–230.
ICALP-v1-2015-BienvenuDS #question #what: What Percentage of Programs Halt? (LB, DD, AS), pp. 219–230.
ICALP-v1-2015-GoldreichGR #branch #context-free grammar #proving #proximity: Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs — (OG, TG, RDR), pp. 666–677.
ICALP-v2-2015-BojanczykMW #bound #clique #datalog #monad: Containment of Monadic Datalog Programs via Bounded Clique-Width (MB, FM, AW), pp. 427–439.
FM-2015-AlbertACGGMPR #analysis #concurrent #distributed: Resource Analysis: From Sequential to Concurrent and Distributed Programs (EA, PA, JC, SG, MGZ, EMM, GP, GRD), pp. 3–17.
FM-2015-FengHTZ #model checking #named #protocol #quantum: QPMC: A Model Checker for Quantum Programs and Protocols (YF, EMH, AT, LZ), pp. 265–272.
SEFM-2015-AmighiDBH #specification #verification: Specification and Verification of Atomic Operations in GPGPU Programs (AA, SD, SB, MH), pp. 69–83.
SEFM-2015-BlomHZ #behaviour #concurrent #functional #verification: History-Based Verification of Functional Behaviour of Concurrent Programs (SB, MH, MZS), pp. 84–98.
SEFM-2015-Muhlberg0DLP #learning #verification: Learning Assertions to Verify Linked-List Programs (JTM, DHW, MD, GL, FP), pp. 37–52.
SEFM-2015-RochaBC #bound #c #generative #memory management #model checking #testing #using: Memory Management Test-Case Generation of C Programs Using Bounded Model Checking (HR, RSB, LCC), pp. 251–267.
CEFP-2015-StutterheimAP #monad #visualisation: Static and Dynamic Visualisations of Monadic Programs (JS, PA, RP), pp. 341–379.
Haskell-2015-FarmerSG #equation #haskell #reasoning #tool support: Reasoning with the HERMIT: tool support for equational reasoning on GHC core programs (AF, NS, AG), pp. 23–34.
ICFP-2015-AvanziniLM #complexity #first-order #functional #higher-order: Analysing the complexity of functional programs: higher-order meets first-order (MA, UDL, GM), pp. 152–164.
FDG-2015-CooperL #education #game studies #named: Panel: Game Programs in Higher Education - Connecting Colleges with Corporations (KMLC, CSL).
GCM-2015-Flick #correctness #graph #on the #recursion: On Correctness of Graph Programs Relative to Recursively Nested Conditions (NEF), pp. 97–112.
HIMI-IKC-2015-WatanabeTA #abstraction #development #learning: Development of a Learning Support System for Reading Source Code by Stepwise Abstraction (KW, TT, TA), pp. 387–394.
ICML-2015-AllamanisTGW #modelling #natural language: Bimodal Modelling of Source Code and Natural Language (MA, DT, ADG, YW), pp. 2123–2132.
SEKE-2015-SchreiberMRM #comprehension #named #object-oriented: TAGGINGSENSE: Method Based On Sensemaking For Object-Oriented Source Code Comprehension (DS, ALAM, SSR, AM), pp. 278–283.
SKY-2015-BinunDL: Archiving Programs for the Future (AB, SD, YL), pp. 53–57.
SPLC-2015-FilhoABAB #empirical #java #product line: Assessing product line derivation operators applied to Java source code: an empirical study (JBFF, SA, OB, MA, BB), pp. 36–45.
ECOOP-2015-BostromM #composition #finite #verification: Modular Verification of Finite Blocking in Non-terminating Programs (PB, PM), pp. 639–663.
OOPSLA-2015-LopesO #how #java: How scale affects structure in Java programs (CVL, JO), pp. 675–694.
OOPSLA-2015-LopezMMNSVY #message passing #parallel #verification: Protocol-based verification of message-passing parallel programs (HAL, ERBM, FM, NN, CS, VTV, NY), pp. 280–298.
LOPSTR-2015-Seki #logic programming #on the: On Dual Programs in Co-Logic Programming (HS), pp. 21–35.
PADL-2015-CruzR #compilation #linear #logic programming #on the: On Compiling Linear Logic Programs with Comprehensions, Aggregates and Rule Priorities (FC, RR), pp. 34–49.
PADL-2015-TamaritVCM #c #haskell #implementation #program transformation #rule-based: A Haskell Implementation of a Rule-Based Program Transformation for C Programs (ST, GV, MC, JM), pp. 105–114.
PEPM-2015-AsadaS0 #first-order #functional #refinement #relational #verification: Verifying Relational Properties of Functional Programs by First-Order Refinement (KA, RS, NK), pp. 61–72.
PEPM-2015-VinayakaraoPN: Structurally Heterogeneous Source Code Examples from Unstructured Knowledge Sources (VV, RP, AVN), pp. 21–26.
PLDI-2015-ChuJT #automation #imperative #induction #proving: Automatic induction proofs of data-structures in imperative programs (DHC, JJ, MTT), pp. 457–466.
PLDI-2015-FaddegonC #algorithm #debugging #dependence #haskell #stack: Algorithmic debugging of real-world haskell programs: deriving dependencies from the cost centre stack (MF, OC), pp. 33–42.
PLDI-2015-Huang #concurrent #model checking #reduction: Stateless model checking concurrent programs with maximal causality reduction (JH), pp. 165–174.
PLDI-2015-LalQ #graph: DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programs (AL, SQ), pp. 280–290.
PLDI-2015-MehtaY #compilation #optimisation #scalability: Improving compiler scalability: optimizing large programs at small price (SM, PCY), pp. 143–152.
PLDI-2015-NguyenH #higher-order: Relatively complete counterexamples for higher-order programs (PCN, DVH), pp. 446–456.
PLDI-2015-NoriORV #performance #probability #synthesis: Efficient synthesis of probabilistic programs (AVN, SO, SKR, DV), pp. 208–217.
PLDI-2015-PrountzosMP #automation #graph #parallel: Synthesizing parallel graph programs via automated planning (DP, RM, KP), pp. 533–544.
PLDI-2015-RenJKAK #execution #hardware #performance #recursion: Efficient execution of recursive programs on commodity vector hardware (BR, YJ, SK, KA, MK), pp. 509–520.
PLDI-2015-SergeyNB #concurrent #fine-grained #verification: Mechanized verification of fine-grained concurrent programs (IS, AN, AB), pp. 77–87.
PLDI-2015-SharmaBA #gpu #verification: Verification of producer-consumer synchronization in GPU programs (RS, MB, AA), pp. 88–98.
POPL-2015-ElangoRPRS #complexity #data access #on the: On Characterizing the Data Access Complexity of Programs (VE, FR, LNP, JR, PS), pp. 567–580.
POPL-2015-GarciaC: Principal Type Schemes for Gradual Programs (RG, MC), pp. 303–315.
POPL-2015-NgoMMP #black box #policy #runtime #security: Runtime Enforcement of Security Policies on Black Box Reactive Programs (MN, FM, DM, FP), pp. 43–54.
POPL-2015-VeanesMML #string: Data-Parallel String-Manipulating Programs (MV, TM, DM, BL), pp. 139–152.
PPDP-2015-CaballeroGS #constraints #datalog #debugging: Debugging of wrong and missing answers for datalog programs with constraint handling rules (RC, YGR, FSP), pp. 55–66.
PPDP-2015-ChenLJZL #automation #declarative #network #safety #verification: Automated verification of safety properties of declarative networking programs (CC, LKL, LJ, WZ, BTL), pp. 79–90.
PPDP-2015-StievenartNMR #abstract interpretation #concurrent #debugging #detection #higher-order: Detecting concurrency bugs in higher-order programs through abstract interpretation (QS, JN, WDM, CDR), pp. 232–243.
SAS-2015-AlbertGG #analysis #interprocedural: May-Happen-in-Parallel Analysis for Asynchronous Programs with Inter-Procedural Synchronization (EA, SG, PG), pp. 72–89.
ASE-2015-AlshanqitiH #contract #java #visual notation: Extracting Visual Contracts from Java Programs (T) (AMA, RH), pp. 104–114.
ASE-2015-FudabaOANHSTN #automation #named #pseudo: Pseudogen: A Tool to Automatically Generate Pseudo-Code from Source Code (HF, YO, KA, GN, HH, SS, TT, SN), pp. 824–829.
ASE-2015-HongLKJKKK #fault #locality #multi: Mutation-Based Fault Localization for Real-World Multilingual Programs (T) (SH, BL, TK, YJ, BK, YK, MK), pp. 464–475.
ASE-2015-KeSGB #code search #semantics: Repairing Programs with Semantic Code Search (T) (YK, KTS, CLG, YB), pp. 295–306.
ASE-2015-MercerAVS #model checking #parallel #using: Model Checking Task Parallel Programs Using Gradual Permissions (N) (EGM, PA, NV, VS), pp. 535–540.
ASE-2015-NguyenNN #approach #divide and conquer #migration #multi #statistics: Divide-and-Conquer Approach for Multi-phase Statistical Migration for Source Code (T) (ATN, TTN, TNN), pp. 585–596.
ASE-2015-OdaFNHSTN #learning #pseudo #statistics #using: Learning to Generate Pseudo-Code from Source Code Using Statistical Machine Translation (T) (YO, HF, GN, HH, SS, TT, SN), pp. 574–584.
ASE-2015-VasquezLVP #database #developer #documentation #how: How do Developers Document Database Usages in Source Code? (N) (MLV, BL, CV, DP), pp. 36–41.
ASE-2015-ZhengRLDS #named #parallel #verification: CIVL: Formal Verification of Parallel Programs (MZ, MSR, ZL, MBD, SFS), pp. 830–835.
ESEC-FSE-2015-BangAB #automation #complexity: Automatically computing path complexity of programs (LB, AA, TB), pp. 61–72.
ESEC-FSE-2015-BraioneDP #execution #symbolic computation: Symbolic execution of programs with heap inputs (PB, GD, MP), pp. 602–613.
ESEC-FSE-2015-CaiC #detection #effectiveness #java #precise: Effective and precise dynamic detection of hidden races for Java programs (YC, LC), pp. 450–461.
ESEC-FSE-2015-DharPDR #named #string: CLOTHO: saving programs from malformed strings and incorrect string-handling (AD, RP, MD, SR), pp. 555–566.
ESEC-FSE-2015-GuoKWYG #execution #parallel #symbolic computation #thread: Assertion guided symbolic execution of multithreaded programs (SG, MK, CW, ZY, AG), pp. 854–865.
ESEC-FSE-2015-KargenS #slicing #using: Turning programs against each other: high coverage fuzz-testing using binary-code mutation and dynamic slicing (UK, NS), pp. 782–792.
ESEC-FSE-2015-Yu #concurrent #named #testing: TACO: test suite augmentation for concurrent programs (TY), pp. 918–921.
ICSE-v1-2015-GaoXMZYZXM #c: Safe Memory-Leak Fixing for C Programs (QG, YX, YM, LZ, WY, ZZ, BX, HM), pp. 459–470.
ICSE-v1-2015-KusanoCW #generative #invariant #parallel #thread: Dynamic Generation of Likely Invariants for Multithreaded Programs (MK, AC, CW), pp. 835–846.
ICSE-v1-2015-TerragniCZ #concurrent #effectiveness #named #testing: RECONTEST: Effective Regression Testing of Concurrent Programs (VT, SCC, CZ), pp. 246–256.
ICSE-v2-2015-MaleticC #analysis #semiparsing #using: Exploration, Analysis, and Manipulation of Source Code Using srcML (JIM, MLC), pp. 951–952.
ICSE-v2-2015-McBurney #automation #documentation #generative #summary: Automatic Documentation Generation via Source Code Summarization (PWM), pp. 903–906.
ICSE-v2-2015-SanchezW #stack overflow: Source Code Curation on StackOverflow: The Vesperin System (HS, JW), pp. 661–664.
ICSE-v2-2015-Schwartz-Narbonne #c #named: VERMEER: A Tool for Tracing and Explaining Faulty C Programs (DSN, CO, MS, TW), pp. 737–740.
SAC-2015-JakobsW #analysis #data flow #proving: Programs from proofs of predicated dataflow analyses (MCJ, HW), pp. 1729–1736.
SAC-2015-ManhaesCZ #automation #performance #predict #student #towards: Towards automatic prediction of student performance in STEM undergraduate degree programs (LMBM, SMSdC, GZ), pp. 247–253.
SAC-2015-MilewiczVTQP #c #runtime: Runtime checking C programs (RM, RV, JT, DQ, PP), pp. 2107–2114.
SAC-2015-RighiVRRCFA #parallel: Rescheduling and checkpointing as strategies to run synchronous parallel programs on P2P desktop grids (RdRR, AV, VFR, GR, CAdC, KF, AMA), pp. 501–504.
SAC-2015-SakuraiM #debugging #object-oriented: The omission finder for debugging what-should-have-happened bugs in object-oriented programs (KS, HM), pp. 1962–1969.
GPCE-2015-FoustJP #constraints #data flow #generative #multi #user interface #visual notation: Generating reactive programs for graphical user interfaces from multi-way dataflow constraint systems (GF, JJ, SP), pp. 121–130.
ASPLOS-2015-RingenburgSACG #approximate #debugging #monitoring #quality: Monitoring and Debugging the Quality of Results in Approximate Programs (MFR, AS, IA, LC, DG), pp. 399–411.
CASE-2015-KouiderHOO #approach #graph #integer #linear #scheduling: Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling (AK, HAH, SO, AO), pp. 1177–1181.
CGO-2015-LuciaC #concurrent: Data provenance tracking for concurrent programs (BL, LC), pp. 146–156.
DATE-2015-RiefertCSRB #automation #generative #on the: On the automatic generation of SBST test programs for in-field test (AR, RC, MS, MSR, BB), pp. 1186–1191.
DATE-2015-TouatiBDGVBR #functional #power management #testing: Exploring the impact of functional test programs re-used for power-aware testing (AT, AB, LD, PG, AV, PB, MSR), pp. 1277–1280.
PDP-2015-OstroumovBW #modelling #parallel: Derivation of Parallel and Resilient Programs from Simulink Models (SO, PB, MAW), pp. 416–420.
PPoPP-2015-ChabbiLJSMI #parallel: Barrier elision for production parallel programs (MC, WL, WdJ, KS, JMMC, CI), pp. 109–119.
PPoPP-2015-McPhersonNSC #detection #legacy: Fence placement for legacy data-race-free programs via synchronization read detection (AJM, VN, SS, MC), pp. 249–250.
SOSP-2015-FangNXDL #memory management #scalability: Interruptible tasks: treating memory pressure as interrupts for highly scalable data-parallel programs (LF, KN, G(X, BD, SL), pp. 394–409.
ESOP-2015-0002S #automation #cost analysis #parallel: Automatic Static Cost Analysis for Parallel Programs (JH, ZS), pp. 132–157.
ESOP-2015-CoxCR #abstraction #multi: Desynchronized Multi-State Abstractions for Open Programs in Dynamic Languages (AC, BYEC, XR), pp. 483–509.
ESOP-2015-DavidKL #strict #termination: Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs (CD, DK, ML), pp. 183–204.
ESOP-2015-DavidKL15a #reasoning #safety #termination: Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs (CD, DK, ML), pp. 661–684.
ESOP-2015-EmmiGMR #analysis: Analysis of Asynchronous Programs with Event-Based Synchronization (ME, PG, RM, FRV), pp. 535–559.
ESOP-2015-GordonRSBRGT #probability #query #spreadsheet: Probabilistic Programs as Spreadsheet Queries (ADG, CVR, MS, JB, NR, TG, DT), pp. 1–25.
ESOP-2015-Penninckx0P #behaviour #composition #verification: Sound, Modular and Compositional Verification of the Input/Output Behavior of Programs (WP, BJ, FP), pp. 158–182.
ESOP-2015-TorontoMH #probability: Running Probabilistic Programs Backwards (NT, JM, DVH), pp. 53–79.
STOC-2015-CanettiH0V #obfuscation #ram: Succinct Garbling and Indistinguishability Obfuscation for RAM Programs (RC, JH, AJ, VV), pp. 429–437.
TACAS-2015-BloemCJK #concurrent #synthesis: Assume-Guarantee Synthesis for Concurrent Reactive Programs with Partial Information (RB, KC, SJ, RK), pp. 517–532.
TACAS-2015-ChenHTWW #contest #named #program transformation #recursion #text-to-text #verification: CPArec: Verifying Recursive Programs via Source-to-Source Program Transformation — (Competition Contribution) (YFC, CH, MHT, BYW, FW), pp. 426–428.
TACAS-2015-ChistikovDM #approximate #estimation #probability #smt: Approximate Counting in SMT and Value Estimation for Probabilistic Programs (DVC, RD, RM), pp. 320–334.
TACAS-2015-DanglLW #contest #float #recursion: CPAchecker with Support for Recursive Programs and Floating-Point Arithmetic — (Competition Contribution) (MD, SL, PW), pp. 423–425.
TACAS-2015-DemasiCRMA #fault tolerance #named #specification: syntMaskFT: A Tool for Synthesizing Masking Fault-Tolerant Programs from Deontic Specifications (RD, PFC, NR, TSEM, NA), pp. 188–193.
TACAS-2015-GurfinkelKN #c #contest #framework #named #verification: SeaHorn: A Framework for Verifying C Programs (Competition Contribution) (AG, TK, JAN), pp. 447–450.
TACAS-2015-Nguyen0TP #bound #c #contest #lazy evaluation: Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C Programs with Unbounded Context Switches — (Competition Contribution) (TLN, BF, SLT, GP), pp. 461–463.
TACAS-2015-StroderAFHG #c #contest #memory management #named #safety #termination: AProVE: Termination and Memory Safety of C Programs — (Competition Contribution) (TS, CA, FF, JH, JG), pp. 417–419.
TACAS-2015-TomascoI0TP15a #concurrent #memory management #verification: Verifying Concurrent Programs by Memory Unwinding (ET, OI, BF, SLT, GP), pp. 551–565.
TACAS-2015-TschannenFNP #functional #named #object-oriented #verification: AutoProof: Auto-Active Functional Verification of Object-Oriented Programs (JT, CAF, MN, NP), pp. 566–580.
CAV-2015-MajumdarW #bound #model checking #named: Bbs: A Phase-Bounded Model Checker for Asynchronous Programs (RM, ZW), pp. 496–503.
CAV-2015-HawblitzelPQT #automation #composition #concurrent #reasoning #refinement: Automated and Modular Refinement Reasoning for Concurrent Programs (CH, EP, SQ, ST), pp. 449–465.
CAV-2015-KuwaharaSU0 #abstraction #functional #higher-order #termination: Predicate Abstraction and CEGAR for Disproving Termination of Higher-Order Functional Programs (TK, RS, HU, NK), pp. 287–303.
CSL-2015-SalvatiW #behaviour #higher-order: A Model for Behavioural Properties of Higher-order Programs (SS, IW), pp. 229–243.
CSL-2015-SchwentickVZ #static analysis: Static Analysis for Logic-based Dynamic Programs (TS, NV, TZ), pp. 308–324.
ICLP-2015-CruzRG #data-driven #logic programming #parallel #thread: Thread-Aware Logic Programming for Data-Driven Parallel Programs (FC, RR, SCG), pp. 191–203.
ICLP-2015-DamasioMA #debugging: Unifying Justifications and Debugging for Answer-Set Programs (CVD, JM, AA), pp. 260–273.
ICLP-2015-KieslST #analysis #on the: On Structural Analysis of Non-Ground Answer-Set Programs (BK, PS, HT), pp. 221–234.
ICLP-2015-YangSZ #bottom-up #evaluation #logic programming #manycore #parallel: Parallel Bottom-Up Evaluation of Logic Programs: DeALS on Shared-Memory Multicore Machines (MY, AS, CZ), pp. 6–17.
ICLP-2015-Zaniolo #algorithm #logic programming: Expressing and Supporting Efficiently Greedy Algorithms as Locally Stratified Logic Programs (CZ), pp. 287–300.
ICLP-J-2015-AngelisFPP #correctness #horn clause #imperative #proving: Proving correctness of imperative programs by linearizing constrained Horn clauses (EDA, FF, AP, MP), pp. 635–650.
ICLP-J-2015-BogaertsB #approximate #compilation #fixpoint #logic programming #using: Knowledge compilation of logic programs using approximation fixpoint theory (BB, GVdB), pp. 464–480.
ICLP-J-2015-FichteTW #logic programming: Dual-normal logic programs — the forgotten class (JKF, MT, SW), pp. 495–510.
LICS-2015-HackettH #exclamation: Programs for Cheap! (JH, GH), pp. 115–126.
VMCAI-2015-AdjeG #automation #invariant #linear #polynomial #synthesis: Automatic Synthesis of Piecewise Linear Quadratic Invariants for Programs (AA, PLG), pp. 99–116.
SIGMOD-2014-0001SW #data flow #named: BabbleFlow: a translator for analytic data flow programs (PJ, AS, KW), pp. 713–716.
EDM-2014-PeroH #detection #how #programming #question #student: How patterns in source codes of students can help in detection of their programming skills? (SP, TH), pp. 371–372.
ITiCSE-2014-DadicGR #automation #evaluation #student: Automatic evaluation of students’ programs (TD, VG, MR), p. 328.
SIGITE-2014-VihavainenLI #analysis: Analysis of source code snapshot granularity levels (AV, ML, PI), pp. 21–26.
CSMR-WCRE-2014-DietrichJB #empirical #evolution #java #library #problem: Broken promises: An empirical study into evolution problems in Java programs caused by library upgrades (JD, KJ, PB), pp. 64–73.
CSMR-WCRE-2014-OliveiraVL #metric: Extracting relative thresholds for source code metrics (PO, MTV, FPL), pp. 254–263.
ICPC-2014-BinkleyHLO #analysis #comprehension: Understanding LDA in source code analysis (DB, DH, DJL, JO), pp. 26–36.
ICPC-2014-HossenKP #maintenance: Amalgamating source code authors, maintainers, and change proneness to triage change requests (KH, HHK, DP), pp. 130–141.
ICPC-2014-McBurneyLMW #summary #topic: Improving topic model source code summarization (PWM, CL, CM, TW), pp. 291–294.
ICPC-2014-McBurneyM #automation #documentation #generative #summary: Automatic documentation generation via source code summarization of method context (PWM, CM), pp. 279–290.
ICPC-2014-NoughiMMC #behaviour #comprehension #database: Understanding the database manipulation behavior of programs (NN, MM, LM, AC), pp. 64–67.
ICPC-2014-VassalloPPC #developer #mining #named: CODES: mining source code descriptions from developers discussions (CV, SP, MDP, GC), pp. 106–109.
ICPC-2014-ZapalowskiNN #architecture: Revealing the relationship between architectural elements and source code characteristics (VZ, IN, DJN), pp. 14–25.
ICSME-2014-EddyK #code search #query #using: Using Structured Queries for Source Code Search (BPE, NAK), pp. 431–435.
ICSME-2014-HallKWM #automation #tool support: Establishing the Source Code Disruption Caused by Automated Remodularisation Tools (MH, MAK, NW, PM), pp. 466–470.
ICSME-2014-Kumar #collaboration #detection: Detecting Collaborative Patterns in Programs (KK), p. 664.
ICSME-2014-OliveiraLVS #metric #named: RTTool: A Tool for Extracting Relative Thresholds for Source Code Metrics (PO, FPL, MTV, AS), pp. 629–632.
ICSME-2014-SahaLKP #c #debugging #effectiveness #information retrieval #locality #on the: On the Effectiveness of Information Retrieval Based Bug Localization for C Programs (RKS, JL, SK, DEP), pp. 161–170.
ICSME-2014-TaoQ #analysis #concurrent #java #refactoring: Refactoring Java Concurrent Programs Based on Synchronization Requirement Analysis (BT, JQ), pp. 361–370.
MSR-2014-AkerblomSTW #python: Tracing dynamic features in python programs (BÅ, JS, MT, TW), pp. 292–295.
MSR-2014-KevicF #taxonomy: A dictionary to translate change tasks to source code (KK, TF), pp. 320–323.
MSR-2014-SteidlHJ #analysis #incremental: Incremental origin analysis of source code files (DS, BH, EJ), pp. 42–51.
MSR-2014-ZanjaniSK #commit #impact analysis #interactive: Impact analysis of change requests on source code based on interaction and commit histories (MBZ, GS, HHK), pp. 162–171.
SCAM-2014-Cortes-CoyVAP #automation #commit #generative #on the #summary: On Automatically Generating Commit Messages via Summarization of Source Code Changes (LFCC, MLV, JA, DP), pp. 275–284.
SCAM-2014-KawamitsuIKKRI #identification #repository #reuse #similarity #using: Identifying Source Code Reuse across Repositories Using LCS-Based Source Code Similarity (NK, TI, TK, RGK, CDR, KI), pp. 305–314.
SCAM-2014-PetiotBJKS #c #generative #testing: Instrumentation of Annotated C Programs for Test Generation (GP, BB, JJ, NK, JS), pp. 105–114.
SCAM-2014-YoshidaH #c #semiparsing #syntax: A Pattern Search Method for Unpreprocessed C Programs Based on Tokenized Syntax Trees (AY, YH), pp. 295–304.
ICALP-v1-2014-HsuRRU #linear: Privately Solving Linear Programs (JH, AR, TR, JU), pp. 612–624.
ICALP-v2-2014-ChistikovM #automaton: Unary Pushdown Automata and Straight-Line Programs (DVC, RM), pp. 146–157.
FM-2014-BlomH #concurrent #verification: The VerCors Tool for Verification of Concurrent Programs (SB, MH), pp. 127–131.
FM-2014-ForejtKNS #analysis #communication #precise #predict: Precise Predictive Analysis for Discovering Communication Deadlocks in MPI Programs (VF, DK, GN, SS), pp. 263–278.
SFM-2014-GiachinoL #concurrent #detection #linear #recursion: Deadlock Detection in Linear Recursive Programs (EG, CL), pp. 26–64.
GRAPHITE-2014-ManskyGG #optimisation #parallel #specification: Specifying and Executing Optimizations for Parallel Programs (WM, DG, ELG), pp. 58–70.
ICGT-2014-JansenGN #execution #generative #induction #pointer #symbolic computation: Generating Inductive Predicates for Symbolic Execution of Pointer-Manipulating Programs (CJ, FG, TN), pp. 65–80.
ICGT-2014-JansenN #generative #graph #pointer #summary: Generating Abstract Graph-Based Procedure Summaries for Pointer Programs (CJ, TN), pp. 49–64.
ICGT-2014-PoskittP #graph #higher-order #monad #verification: Verifying Monadic Second-Order Properties of Graph Programs (CMP, DP), pp. 33–48.
HCI-TMT-2014-HankiewiczB #performance #quality #using #word: Efficiency in Performing Basic Tasks Using Word Processing Programs by the Elderly as a Measure of the Ergonomic Quality of Software (KH, MB), pp. 481–488.
HCI-TMT-2014-RodriguesTN14a #heuristic #interactive: Heuristics for Assessing Emotional Response of Viewers during the Interaction with TV Programs (KRdHR, CACT, VPdAN), pp. 577–588.
HIMI-AS-2014-AraiKTKA #comprehension #development #learning: Development of a Learning Support System for Source Code Reading Comprehension (TA, HK, TT, YK, TA), pp. 12–19.
ICEIS-v2-2014-DingTZ #automation #c #c++: Automatic Removal of Buffer Overflow Vulnerabilities in C/C++ Programs (SD, HBKT, HZ), pp. 49–59.
ICML-c2-2014-MaddisonT #generative #modelling: Structured Generative Models of Natural Source Code (CJM, DT), pp. 649–657.
KDD-2014-ShakarianSPB #network #social: Reducing gang violence through network influence based targeting of social programs (PS, JS, WP, JB), pp. 1829–1836.
KR-2014-AsuncionZZ #first-order #logic programming #semantics: Logic Programs with Ordered Disjunction: First-Order Semantics and Expressiveness (VA, YZ, HZ).
KR-2014-Lin #first-order #formal method #linear #logic: A Formalization of Programs in First-Order Logic with a Discrete Linear Order (FL).
KR-2014-Potyka #consistency #linear #logic #nondeterminism #probability: Linear Programs for Measuring Inconsistency in Probabilistic Logics (NP).
KR-2014-ShenZ #canonical #logic programming: Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas (YS, XZ).
MLDM-2014-KhasnabishSDS #detection #learning #programming language #using: Detecting Programming Language from Source Code Using Bayesian Learning Techniques (JNK, MS, JD, GS), pp. 513–522.
SEKE-2014-Al-MsiedeenSHUV #implementation #object-oriented: Documenting the Mined Feature Implementations from the Object-oriented Source Code of a Collection of Software Product Variants (RAM, AS, MH, CU, SV), pp. 138–143.
SEKE-2014-JiangCKZD #model transformation #testing #using: Testing Model Transformation Programs using Metamorphic Testing (MJ, TYC, FCK, ZZ, ZD), pp. 94–99.
SEKE-2014-OliveiraMGND #framework #testing: An Extensible Framework to Implement Test Oracle for Non-Testable Programs (RAPO, AMM, VNG, FLSN, MED), pp. 199–204.
SEKE-2014-SantosBSC #game studies #learning #programming #semantics: A Semantic Analyzer for Simple Games Source Codes to Programming Learning (ECOdS, GBB, VHVdS, EC), pp. 522–527.
ECOOP-2014-AliRLDT #graph #scala: Constructing Call Graphs of Scala Programs (KA, MR, OL, JD, FT), pp. 54–79.
ECOOP-2014-LiT #analysis #fault #python: Finding Reference-Counting Errors in Python/C Programs with Affine Analysis (SL, GT), pp. 80–104.
OOPSLA-2014-BartensteinL: Rate types for stream programs (TB, YDL), pp. 213–232.
OOPSLA-2014-BerganGC #execution #parallel #symbolic computation #thread: Symbolic execution of multithreaded programs from arbitrary program contexts (TB, DG, LC), pp. 491–506.
OOPSLA-2014-Desai0M #proving #reduction #using: Natural proofs for asynchronous programs using almost-synchronous reductions (AD, PG, PM), pp. 709–725.
OOPSLA-2014-XiaoGZZZYWLCZ #named #reduction: Cybertron: pushing the limit on I/O reduction in data-parallel programs (TX, ZG, HZ, JZ, XZ, CY, XW, WL, WC, LZ), pp. 895–908.
AdaEurope-2014-BurgstallerB #ada #algebra #static analysis: Kronecker Algebra for Static Analysis of Ada Programs with Protected Objects (BB, JB), pp. 27–42.
HILT-2014-RathjeR #framework #java #model checking #network: A framework for model checking UDP network programs with Java pathfinder (WR, BR), pp. 81–86.
LOPSTR-2014-ChowdhuryLCKY #approximate #case study #logic programming #polynomial #semantics: Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies (MSC, FL, WC, AK, JHY), pp. 279–296.
LOPSTR-2014-CornishGNSSS #array #program transformation: Analyzing Array Manipulating Programs by Program Transformation (JRMC, GG, JAN, PS, HS, PJS), pp. 3–20.
LOPSTR-2014-Drabent #logic programming #on the: On Completeness of Logic Programs (WD), pp. 261–278.
PADL-2014-AreiasR #correctness #logic programming #on the #performance: On the Correctness and Efficiency of Lock-Free Expandable Tries for Tabled Logic Programs (MA, RR), pp. 168–183.
PADL-2014-SonPL #multi #prolog: Two Applications of the ASP-Prolog System: Decomposable Programs and Multi-context Systems (TCS, EP, TL), pp. 87–103.
PEPM-2014-HanusS #analysis #composition #functional #logic programming: A modular and generic analysis server system for functional logic programs (MH, FS), pp. 181–188.
PLDI-2014-BallBGIKSSV #named #network #towards #verification: VeriCon: towards verifying controller programs in software-defined networks (TB, NB, AG, SI, AK, MS, MS, AV), p. 31.
PLDI-2014-Carbonneaux0RS #bound #c #verification: End-to-end verification of stack-space bounds for C programs (QC, JH, TR, ZS), p. 30.
PLDI-2014-GuptaSS #execution #parallel: Globally precise-restartable execution of parallel programs (GG, SS, GSS), p. 22.
PLDI-2014-HurNRS #probability #slicing: Slicing probabilistic programs (CKH, AVN, SKR, SS), p. 16.
PLDI-2014-Schkufza0A #float #optimisation #precise #probability: Stochastic optimization of floating-point programs with tunable precision (ES, RS, AA), p. 9.
PLDI-2014-SridharanGS #adaptation #execution #parallel #performance: Adaptive, efficient, parallel execution of parallel programs (SS, GG, GSS), p. 21.
PLDI-2014-SurendranRCMS #parallel #testing: Test-driven repair of data races in structured parallel programs (RS, RR, SC, JMMC, VS), p. 3.
POPL-2014-Birkedal #composition #concurrent #higher-order #imperative #reasoning: Modular reasoning about concurrent higher-order imperative programs (LB), pp. 1–2.
POPL-2014-CasinghinoSW #proving: Combining proofs and programs in a dependently typed language (CC, VS, SW), pp. 33–46.
POPL-2014-ChaudhuriFK #analysis #consistency: Consistency analysis of decision-making programs (SC, AF, ZK), pp. 555–568.
POPL-2014-LagoSA #functional #higher-order #induction #on the #probability: On coinductive equivalences for higher-order probabilistic functional programs (UDL, DS, MA), pp. 297–308.
PPDP-2014-CruzRG #design #implementation #linear #logic programming #parallel #thread #virtual machine: Design and Implementation of a Multithreaded Virtual Machine for Executing Linear Logic Programs (FC, RR, SCG), pp. 43–54.
PPDP-2014-FerreiraP #bidirectional: Bidirectional Elaboration of Dependently Typed Programs (FF, BP), pp. 161–174.
PPDP-2014-Giacobazzi: Unveiling and Veiling Information in Programs (RG), pp. 211–212.
PPDP-2014-LucasM #declarative #logic #proving #termination: Proving Operational Termination of Declarative Programs in General Logics (SL, JM), pp. 111–122.
PPDP-2014-Schopp #low level #using: Organising Low-Level Programs using Higher Types (US), pp. 199–210.
PPDP-2014-StulovaMH #debugging #higher-order: Assertion-based Debugging of Higher-Order (C)LP Programs (NS, JFM, MVH), pp. 225–235.
SAS-2014-ChenHTWW #recursion #using #verification: Verifying Recursive Programs Using Intraprocedural Analyzers (YFC, CH, MHT, BYW, FW), pp. 118–133.
SAS-2014-CoxCR #analysis #automation: Automatic Analysis of Open Objects in Dynamic Language Programs (AC, BYEC, XR), pp. 134–150.
ASE-2014-FalleriMBMM #difference #fine-grained: Fine-grained and accurate source code differencing (JRF, FM, XB, MM, MM), pp. 313–324.
ASE-2014-HigoK #consistency #named #nondeterminism: MPAnalyzer: a tool for finding unintended inconsistencies in program source code (YH, SK), pp. 843–846.
ASE-2014-LuckowPDFV #approximate #execution #nondeterminism #probability #symbolic computation: Exact and approximate probabilistic symbolic execution for nondeterministic programs (KSL, CSP, MBD, AF, WV), pp. 575–586.
ASE-2014-TarvoR #analysis #automation #modelling #parallel #performance #thread: Automated analysis of multithreaded programs for performance modeling (AT, SPR), pp. 7–18.
FSE-2014-AllamanisS #mining: Mining idioms from source code (MA, CAS), pp. 472–483.
FSE-2014-BaltesSD #diagrams #sketching: Linking sketches and diagrams to source code artifacts (SB, PS, SD), pp. 743–746.
FSE-2014-EslamimehrP #concurrent #detection #named #scalability: Sherlock: scalable deadlock detection for concurrent programs (ME, JP), pp. 353–365.
FSE-2014-HigoK #case study #functional #how #java: How should we measure functional sameness from program source code? an exploratory study on Java methods (YH, SK), pp. 294–305.
ICSE-2014-CachoCFSCSGBG #c# #empirical #evolution #maintenance #robust: Trading robustness for maintainability: an empirical study of evolving c# programs (NC, TC, TF, ES, AC, RS, IG, EAB, AG), pp. 584–595.
ICSE-2014-CaiWC #approach #constraints #dynamic analysis #named #parallel #thread: ConLock: a constraint-based approach to dynamic checking on deadlocks in multithreaded programs (YC, SW, WKC), pp. 491–502.
ICSE-2014-JiangGXML #concurrent #java #named: CARE: cache guided deterministic replay for concurrent Java programs (YJ, TG, CX, XM, JL), pp. 457–467.
ICSE-2014-RodegheroMMBD #automation #summary: Improving automated source code summarization via an eye-tracking study of programmers (PR, CM, PWM, NB, SKD), pp. 390–401.
ICSE-2014-SiegmundKAPBLSB #comprehension #functional: Understanding understanding source code with functional magnetic resonance imaging (JS, CK, SA, CP, AB, TL, GS, AB), pp. 378–389.
SAC-2014-PereiraS #complexity #deduction: Complexity checking of ARM programs, by deduction (MP, SMdS), pp. 1309–1314.
SAC-2014-RiveraC #java: Translating event-B to JML-specified Java programs (VR, NC), pp. 1264–1271.
CC-2014-FeautrierVK #performance: Improving the Performance of X10 Programs by Clock Removal (PF, EV, AK), pp. 113–132.
CGO-2014-PanditG #execution #kernel #multi: Fluidic Kernels: Cooperative Execution of OpenCL Programs on Multiple Heterogeneous Devices (PP, RG), p. 273.
DAC-2014-AthavaleMHV #analysis #test coverage #using: Code Coverage of Assertions Using RTL Source Code Analysis (VA, SM, SH, SV), p. 6.
DAC-2014-EldibWTS #named: QMS: Evaluating the Side-Channel Resistance of Masked Software from Source Code (HE, CW, MMIT, PS), p. 6.
DAC-2014-KozhikkottuPPDR #clustering #parallel #thread: Variation Aware Cache Partitioning for Multithreaded Programs (VJK, AP, VSP, SD, AR), p. 6.
HPCA-2014-WangDDS #concurrent #memory management #multi #named #predict #thread: DraMon: Predicting memory bandwidth usage of multi-threaded programs with high accuracy and low overhead (WW, TD, JWD, MLS), pp. 380–391.
LCTES-2014-ChandramohanO #clustering #design #energy: Partitioning data-parallel programs for heterogeneous MPSoCs: time and energy design space exploration (KC, MFPO), pp. 73–82.
OSDI-2014-KimHZHWWS #abstraction #gpu #named #network: GPUnet: Networking Abstractions for GPU Programs (SK, SH, XZ, YH, AW, EW, MS), pp. 201–216.
PDP-2014-AcostaA #analysis #performance: Performance Analysis of Paralldroid Generated Programs (AA, FA), pp. 60–67.
PDP-2014-BarnatBH #model checking #parallel: Model Checking Parallel Programs with Inputs (JB, PB, VH), pp. 756–759.
PDP-2014-BaudischBS #communication #message passing: Reducing the Communication of Message-Passing Systems Synthesized from Synchronous Programs (DB, YB, KS), pp. 444–451.
PDP-2014-FalcoLOSTT #distributed #optimisation: Extremal Optimization with Guided State Changes in Load Balancing of Distributed Programs (IDF, EL, RO, US, ET, MT), pp. 228–231.
PPoPP-2014-AgrawalFSSU #data type #parallel #scheduling: Provably good scheduling for parallel programs that use data structures through implicit batching (KA, JTF, BS, JS, RU), pp. 389–390.
PPoPP-2014-EslamimehrP #concurrent #scheduling: Race directed scheduling of concurrent programs (ME, JP), pp. 301–314.
PPoPP-2014-LiuM #architecture #parallel #performance #thread: A tool to analyze the performance of multithreaded programs on NUMA architectures (XL, JMMC), pp. 259–272.
ESOP-2014-BrainDKS #generative #proving: Model and Proof Generation for Heap-Manipulating Programs (MB, CD, DK, PS), pp. 432–452.
ESOP-2014-KuwaharaTU0 #automation #functional #higher-order #termination #verification: Automatic Termination Verification for Higher-Order Functional Programs (TK, TT, HU, NK), pp. 392–411.
FASE-2014-GomesPG #bytecode #control flow #graph #java: Sound Control Flow Graph Extraction from Incomplete Java Bytecode Programs (PdCG, AP, DG), pp. 215–229.
FASE-2014-Zaharieva-StojanovskiH #concurrent #invariant #verification: Verifying Class Invariants in Concurrent Programs (MZS, MH), pp. 230–245.
FoSSaCS-2014-Tsukada0 #call-by #complexity #model checking: Complexity of Model-Checking Call-by-Value Programs (TT, NK), pp. 180–194.
STOC-2014-ForbesSS #algebra #branch #multi #order #set: Hitting sets for multilinear read-once algebraic branching programs, in any order (MAF, RS, AS), pp. 867–875.
TACAS-2014-AngelisFPP #named #verification: VeriMAP: A Tool for Verifying Programs through Transformations (EDA, FF, AP, MP), pp. 568–574.
TACAS-2014-BrockschmidtEFFG #analysis #complexity #integer #runtime: Alternating Runtime and Size Complexity Analysis of Integer Programs (MB, FE, SF, CF, JG), pp. 140–155.
TACAS-2014-CaballeroMRT #debugging #declarative #erlang #named: EDD: A Declarative Debugger for Sequential Erlang Programs (RC, EMM, AR, ST), pp. 581–586.
TACAS-2014-TomascoI0TP #c #contest #memory management #named: MU-CSeq: Sequentialization of C Programs by Shared Memory Unwindings — (Competition Contribution) (ET, OI, BF, SLT, GP), pp. 402–404.
WRLA-2014-AlrahmanABL #concurrent #maude #memory management #modelling #question: Can We Efficiently Check Concurrent Programs Under Relaxed Memory Models in Maude? (YAA, MA, AB, ALL), pp. 21–41.
WRLA-2014-Genet #automaton #functional #static analysis #towards #using: Towards Static Analysis of Functional Programs Using Tree Automata Completion (TG), pp. 147–161.
CAV-2014-ChengHRS #automation #generative #named: G4LTL-ST: Automatic Generation of PLC Programs (CHC, CHH, HR, SS), pp. 541–549.
CAV-2014-HeizmannHP #analysis #learning #termination: Termination Analysis by Learning Terminating Programs (MH, JH, AP), pp. 797–813.
CAV-2014-InversoT0TP #bound #c #concurrent #lazy evaluation #model checking #multi #thread: Bounded Model Checking of Multi-threaded C Programs via Lazy Sequentialization (OI, ET, BF, SLT, GP), pp. 585–602.
CAV-2014-KomuravelliGC #model checking #recursion #smt: SMT-Based Model Checking for Recursive Programs (AK, AG, SC), pp. 17–34.
CAV-2014-KupriyanovF #concurrent #multi #termination #thread: Causal Termination of Multi-threaded Programs (AK, BF), pp. 814–830.
CAV-2014-MadhavanK #bound #functional: Symbolic Resource Bound Inference for Functional Programs (RM, VK), pp. 762–778.
ICLP-J-2014-Antic #on the #set: On Cascade Products of Answer Set Programs (CA), pp. 711–723.
ICLP-J-2014-CabalarFF #graph #logic programming: Causal Graph Justifications of Logic Programs (PC, JF, MF), pp. 603–618.
ICLP-J-2014-GelfondZ #logic programming: Vicious Circle Principle and Logic Programs with Aggregates (MG, YZ), pp. 587–601.
ICLP-J-2014-SerranoLH #abstract interpretation #analysis #logic programming #resource management #using: Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types (AS, PLG, MVH), pp. 739–754.
ICST-2014-KifetewJTOT #grammarware: Reproducing Field Failures for Programs with Complex Grammar-Based Input (FMK, WJ, RT, AO, PT), pp. 163–172.
ICST-2014-MoonKKY #fault #locality: Ask the Mutants: Mutating Faulty Programs for Fault Localization (SM, YK, MK, SY), pp. 153–162.
IJCAR-2014-GieslBEFFOPSSST #automation #proving #termination: Proving Termination of Programs Automatically with AProVE (JG, MB, FE, FF, CF, CO, MP, PSK, TS, SS, RT), pp. 184–191.
IJCAR-2014-StroderGBFFHS #memory management #pointer #proving #safety #termination: Proving Termination and Memory Safety for Programs with Pointer Arithmetic (TS, JG, MB, FF, CF, JH, PSK), pp. 208–223.
ISSTA-2014-BaudryAM #program transformation: Tailored source code transformations to synthesize computationally diverse program variants (BB, SA, MM), pp. 149–159.
ISSTA-2014-JustJE #database #fault #java #named #testing: Defects4J: a database of existing faults to enable controlled testing studies for Java programs (RJ, DJ, MDE), pp. 437–440.
ISSTA-2014-LeAGG #haskell #mutation testing #named #testing: MuCheck: an extensible tool for mutation testing of haskell programs (DL, MAA, RG, AG), pp. 429–432.
ISSTA-2014-LinK #automation #concurrent #multi #satisfiability #thread #using: Automatic repair for multi-threaded programs with Deadlock/Livelock using maximum satisfiability (YL, SSK), pp. 237–247.
ISSTA-2014-XuZXW #c #named: Canalyze: a static bug-finding tool for C programs (ZX, JZ, ZX, JW), pp. 425–428.
LICS-CSL-2014-LiangFS #composition #concurrent #refinement #verification: Compositional verification of termination-preserving refinement of concurrent programs (HL, XF, ZS), p. 10.
TAP-2014-KahkonenH #automation #lightweight #parallel #testing #thread: Lightweight State Capturing for Automated Testing of Multithreaded Programs (KK, KH), pp. 187–203.
VMCAI-2014-AngelisFPP #array #verification: Verifying Array Programs by Transforming Verification Conditions (EDA, FF, AP, MP), pp. 182–202.
VMCAI-2014-BozgaIK #integer #problem #safety: Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops (MB, RI, FK), pp. 242–261.
VMCAI-2014-LeikeT #polynomial #synthesis: Synthesis for Polynomial Lasso Programs (JL, AT), pp. 434–452.
VMCAI-2014-SchwarzSVA #analysis #precise: Precise Analysis of Value-Dependent Synchronization in Priority Scheduled Programs (MDS, HS, VV, KA), pp. 21–38.
CSEET-2013-ArdisBCVI #education #re-engineering #using: Using GSwE2009 in the creation and modification of graduate software engineering programs and related curricula (MAA, SB, LC, DV, SI), pp. 109–118.
ITiCSE-2013-HawthorneC #learning: ACM core IT learning outcomes for associate-degree programs (EKH, RDC), p. 357.
ITiCSE-2013-HowardS #communication #overview #re-engineering: A survey of communication skills in computerscience/software engineering (CS/SE) abet-accredited programs (AH, BS), p. 364.
SIGITE-2013-KushalnagarLO #community #student: A transition community for deaf and hard of hearing students in information technology programs (RSK, DEL, EMO), pp. 143–144.
SIGITE-2013-LuntA #identification: Identifying information technology graduate-level programs (BML, MQA), pp. 55–58.
SIGITE-2013-McGillSD #game studies #student: Demographics of undergraduate students in game degree programs in the US and UK (MM, AS, AD), pp. 43–50.
CSMR-2013-KazatoHKOOMHS #feature model #identification #incremental: Incremental Feature Location and Identification in Source Code (HK, SH, TK, TO, SO, SM, TH, MS), pp. 371–374.
CSMR-2013-MazzeoTBS: Linking E-Mails and Source Code with LASCO (LM, AT, RB, GS), pp. 421–424.
CSMR-2013-Molitorisz #process #refactoring: Pattern-Based Refactoring Process of Sequential Source Code (KM), pp. 357–360.
CSMR-2013-Pichler #documentation #experience #fortran #industrial: Extraction of Documentation from Fortran 90 Source Code: An Industrial Experience (JP), pp. 399–402.
CSMR-2013-ScannielloGT #comprehension #diagrams #sequence chart: An Early Investigation on the Contribution of Class and Sequence Diagrams in Source Code Comprehension (GS, CG, GT), pp. 367–370.
CSMR-2013-TothNFS #using #version control: Using Version Control History to Follow the Changes of Source Code Elements (ZT, GN, RF, IS), pp. 319–322.
ICPC-2013-BernhartG #code review #comprehension #on the: On the understanding of programs with continuous code reviews (MB, TG), pp. 192–198.
ICPC-2013-EddyRKC #replication #summary: Evaluating source code summarization techniques: Replication and expansion (BPE, JAR, NAK, JCC), pp. 13–22.
ICPC-2013-MurakamiHHIK #analysis #clone detection #detection #lightweight: Gapped code clone detection with lightweight source code analysis (HM, KH, YH, HI, SK), pp. 93–102.
ICPC-2013-SteidlHJ #analysis #quality: Quality analysis of source code comments (DS, BH, EJ), pp. 83–92.
ICSM-2013-AlhindawiDCM #feature model: Improving Feature Location by Enhancing Source Code with Stereotypes (NA, ND, MLC, JIM), pp. 300–309.
ICSM-2013-AsaduzzamanRSP #approach #hybrid #independence #named: LHDiff: A Language-Independent Hybrid Approach for Tracking Source Code Lines (MA, CKR, KAS, MDP), pp. 230–239.
ICSM-2013-AsaduzzamanRSP13a #maintenance #named #process: LHDiff: Tracking Source Code Lines to Support Software Maintenance Activities (MA, CKR, KAS, MDP), pp. 484–487.
ICSM-2013-CollardDM #analysis #framework #named #semiparsing #tool support: srcML: An Infrastructure for the Exploration, Analysis, and Manipulation of Source Code: A Tool Demonstration (MLC, MJD, JIM), pp. 516–519.
ICSM-2013-MorenoBHM #debugging #on the: On the Relationship between the Vocabulary of Bug Reports and Source Code (LM, WB, SH, AM), pp. 452–455.
ICSM-2013-ScannielloR #fault #identifier: Dealing with Faults in Source Code: Abbreviated vs. Full-Word Identifier Names (GS, MR), pp. 190–199.
ICSM-2013-XinQHXZWG #concurrent #empirical: An Automation-Assisted Empirical Study on Lock Usage for Concurrent Programs (RX, ZQ, SH, CX, YZ, YW, HG), pp. 100–109.
MSR-2013-AllamanisS13a #mining #modelling #repository #using: Mining source code repositories at massive scale using language modeling (MA, CAS), pp. 207–216.
MSR-2013-JanjicHSA #dataset #research #reuse: An unabridged source code dataset for research in software reuse (WJ, OH, MS, CA), pp. 339–342.
MSR-2013-WangDZCXZ #api #mining: Mining succinct and high-coverage API usage patterns from source code (JW, YD, HZ, KC, TX, DZ), pp. 319–328.
SCAM-2013-FabryRJ #analysis: Aspectual source code analysis with GASR (JF, CDR, VJ), pp. 53–62.
SCAM-2013-MarcozziVH #algorithm #constraints #database #execution #relational #symbolic computation #testing: A relational symbolic execution algorithm for constraint-based testing of database programs (MM, WV, JLH), pp. 179–188.
ICALP-v2-2013-BartheO #composition #difference #logic #privacy #probability #relational #theorem: Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs (GB, FO), pp. 49–60.
IFM-2013-Abrial #proving: From Z to B and then Event-B: Assigning Proofs to Meaningful Programs (JRA), pp. 1–15.
TLCA-2013-SeveriV #modelling: Completeness of Conversion between Reactive Programs for Ultrametric Models (PS, FJdV), pp. 221–235.
ICFP-2013-AxelssonC #functional #higher-order #syntax #using: Using circular programs for higher-order syntax: functional pearl (EA, KC), pp. 257–262.
ICFP-2013-McDonellCKL #functional #gpu #optimisation: Optimising purely functional GPU programs (TLM, MMTC, GK, BL), pp. 49–60.
IFL-2013-HackettHJ #approach #optimisation #recursion: The Under-Performing Unfold: A new approach to optimising corecursive programs (JH, GH, MJ), p. 1.
GCM-J-2012-PoskittP #correctness #graph #verification: Verifying Total Correctness of Graph Programs (CMP, DP).
CHI-2013-KatoSI #named #representation: Picode: inline photos representing posture data in source code (JK, DS, TI), pp. 3097–3100.
HCI-IMT-2013-OkuuchiKKK #modelling: Modeling Situation-Dependent Nonverbal Expressions for a Pair of Embodied Agent in a Dialogue Based on Conversations in TV Programs (KO, KK, TK, DK), pp. 340–347.
HCI-UC-2013-RodriguesNT #interactive #multi: Interaction of the Elderly Viewer with Additional Multimedia Content to Support the Appreciation of Television Programs (KRdHR, VPdAN, CACT), pp. 227–236.
OCSC-2013-YamauchiHN #analysis #twitter: Searching Emotional Scenes in TV Programs Based on Twitter Emotion Analysis (TY, YH, YIN), pp. 432–441.
VISSOFT-2013-BeckHDW #embedded #monitoring #visual notation: Visual monitoring of numeric variables embedded in source code (FB, FH, SD, DW), pp. 1–4.
VISSOFT-2013-ServantJ #named #slicing #visualisation: Chronos: Visualizing slices of source-code history (FS, JAJ), pp. 1–4.
ICEIS-v2-2013-ToureSA #enterprise #modelling #validation: A2MO and ETREOSys — Analyzing, Modeling and Validation of Enterprise Training Programs (FT, MS, EA), pp. 310–316.
ICML-c1-2013-BuhlerRSH #clustering #community #detection #set: Constrained fractional set programs and their application in local clustering and community detection (TB, SSR, SS, MH), pp. 624–632.
KDIR-KMIS-2013-PereiraRT #data mining #mining #student: Extraction Student Dropout Patterns with Data Mining Techniques in Undergraduate Programs (RTP, ACR, JJT), pp. 136–142.
KEOD-2013-Cruz-FilipeNG #logic programming #multi #ontology: Patterns for Interfacing between Logic Programs and Multiple Ontologies (LCF, IN, GG), pp. 58–69.
SEKE-2013-Al-MsiedeenSHUVS #concept analysis #mining #object-oriented #semantics #using: Mining Features from the Object-Oriented Source Code of a Collection of Software Variants Using Formal Concept Analysis and Latent Semantic Indexing (RAM, ADS, MH, CU, SV, HES), pp. 244–249.
SEKE-2013-AlshammariFC #bytecode #java #metric #security: Security Metrics for Java Bytecode Programs (BA, CJF, DC), pp. 394–399.
SEKE-2013-QiHW #combinator #concurrent #testing: A Mixed-way Combinatorial Testing for Concurrent Programs (XQ, JH, PW), pp. 699–702.
SEKE-2013-RamosRO #process #towards: Towards a strategy for analysing benefits of Software Process Improvement programs (CSR, ARR, KMdO), pp. 638–643.
SEKE-2013-TerraBMVSCB #similarity: Measuring the Structural Similarity between Source Code Entities (RT, JB, LFM, MTV, DS, DC, RdSB), pp. 753–758.
SEKE-2013-YuanYL #debugging #fine-grained #predict: Bug Prediction for Fine-Grained Source Code Changes (ZY, LY, CL), pp. 381–387.
MoDELS-2013-PiresPWD #behaviour #embedded #verification: Behavioural Verification in Embedded Software, from Model to Source Code (AFP, TP, VW, SD), pp. 320–335.
SPLC-2013-KandaII #evolution: Extraction of product evolution tree from source code of product variants (TK, TI, KI), pp. 141–150.
SPLC-2013-TsuchiyaKWKFY #requirements #traceability: Recovering traceability links between requirements and source code in the same series of software products (RT, TK, HW, MK, YF, KY), pp. 121–130.
ECOOP-2013-LernerELK #static typing: Combining Form and Function: Static Types for JQuery Programs (BSL, LE, JL, SK), pp. 79–103.
OOPSLA-2013-BerganCG #parallel #thread: Input-covering schedules for multithreaded programs (TB, LC, DG), pp. 677–692.
OOPSLA-2013-CarbinMR #hardware #reliability #verification: Verifying quantitative reliability for programs that execute on unreliable hardware (MC, SM, MCR), pp. 33–52.
OOPSLA-2013-RaychevVS #concurrent #detection #effectiveness: Effective race detection for event-driven programs (VR, MTV, MS), pp. 151–166.
OOPSLA-2013-Xu #named #optimisation #profiling: Resurrector: a tunable object lifetime profiling technique for optimizing real-world programs (G(X), pp. 111–130.
HILT-2013-Taft #concurrent #named #parallel #proving #safety #thread #tutorial: Tutorial: proving safety of parallel / multi-threaded programs (STT), pp. 1–2.
LOPSTR-2013-LiqatKSGLGHE #analysis #energy #modelling: Energy Consumption Analysis of Programs Based on XMOS ISA-Level Models (UL, SK, AS, KG, PLG, NG, MVH, KE), pp. 72–90.
LOPSTR-2013-Seki #logic programming #model checking: Extending Co-logic Programs for Branching-Time Model Checking (HS), pp. 127–144.
PADL-2013-LiangK #automation #logic programming #named #scalability: Terminyzer: An Automatic Non-termination Analyzer for Large Logic Programs (SL, MK), pp. 173–189.
PEPM-2013-AngelisFPP #verification: Verifying programs via iterated specialization (EDA, FF, AP, MP), pp. 43–52.
PEPM-2013-SatoUK #higher-order #model checking #scalability #towards: Towards a scalable software model checker for higher-order programs (RS, HU, NK), pp. 53–62.
PEPM-2013-SunCZ #analysis #constraints #locality: Constraint-based locality analysis for X10 programs (QS, YC, JZ), pp. 137–146.
PLDI-2013-CookK #nondeterminism #reasoning: Reasoning about nondeterminism in programs (BC, EK), pp. 219–230.
PLDI-2013-SankaranarayananCG #probability #static analysis: Static analysis for probabilistic programs: inferring whole program properties from finitely many paths (SS, AC, SG), pp. 447–458.
PLDI-2013-SwamyWSCL #higher-order #monad #verification: Verifying higher-order programs with the dijkstra monad (NS, JW, CS, JC, BL), pp. 387–398.
POPL-2013-Dinsdale-YoungBGPY #composition #concurrent #named #reasoning: Views: compositional reasoning for concurrent programs (TDY, LB, PG, MJP, HY), pp. 287–300.
POPL-2013-RompfSABJLJOO #compilation #data type #optimisation #staging: Optimizing data structures in high-level programs: new directions for extensible compilers based on staging (TR, AKS, NA, KJB, VJ, HL, MJ, KO, MO), pp. 497–510.
POPL-2013-UnnoTK #automation #functional #higher-order #verification: Automating relatively complete verification of higher-order functional programs (HU, TT, NK), pp. 75–86.
PPDP-2013-CalauttiGT #decidability #detection #logic programming: Detecting decidable classes of finitely ground logic programs with function symbols (MC, SG, IT), pp. 239–250.
PPDP-2013-ChristiansenHRS #encapsulation #functional #logic programming #semantics: A semantics for weakly encapsulated search in functional logic programs (JC, MH, FR, DS), pp. 49–60.
QAPL-2013-NgoH #analysis #concurrent #multi #security #thread: Quantitative Security Analysis for Multi-threaded Programs (TMN, MH), pp. 34–48.
SAS-2013-BrainDGHK #float #verification: Interpolation-Based Verification of Floating-Point Programs with Abstract CDCL (MB, VD, AG, LH, DK), pp. 412–432.
SAS-2013-Goubault #abstract interpretation #static analysis: Static Analysis by Abstract Interpretation of Numerical Programs and Systems, and FLUCTUAT (EG), pp. 1–3.
SAS-2013-Komondoor #abstract interpretation #imperative #precise #slicing: Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation (RK), pp. 259–282.
SAS-2013-MajumdarMW #message passing #verification: Static Provenance Verification for Message Passing Programs (RM, RM, ZW), pp. 366–387.
SAS-2013-PartushY #difference #semantics: Abstract Semantic Differencing for Numerical Programs (NP, EY), pp. 238–258.
SAS-2013-Roy: From Concrete Examples to Heap Manipulating Programs (SR), pp. 126–149.
REFSQ-2013-DelaterP #development #perspective #requirements #research: Analyzing the Tracing of Requirements and Source Code during Software Development — A Research Preview (AD, BP), pp. 308–314.
ASE-2013-ChoDS #bound #composition #model checking #named: BLITZ: Compositional bounded model checking for real-world programs (CYC, VD, DS), pp. 136–146.
ASE-2013-Demasi #fault tolerance #logic #specification: Synthesizing fault-tolerant programs from deontic logic specifications (RD), pp. 750–753.
ASE-2013-KifetewJTOT #approach #grammarware #named: SBFR: A search based approach for reproducing failures of programs with grammar based input (FMK, WJ, RT, AO, PT), pp. 604–609.
ASE-2013-LiRSDC #data flow #generative #named: SEDGE: Symbolic example data generation for dataflow programs (KL, CR, YS, YD, CC), pp. 235–245.
ASE-2013-MoritzVPGMG #api #detection #named #repository #scalability #visualisation: ExPort: Detecting and visualizing API usages in large source code repositories (EM, MLV, DP, MG, CM, MG), pp. 646–651.
ASE-2013-PalombaBPOLP #detection #smell #using: Detecting bad smells in source code using change history information (FP, GB, MDP, RO, ADL, DP), pp. 268–278.
ASE-2013-TasharofiPLJ #automation #named #testing: Bita: Coverage-guided, automatic testing of actor programs (ST, MP, YL, REJ), pp. 114–124.
ESEC-FSE-2013-NavabpourJWBMBF #c #named #runtime #verification: RiTHM: a tool for enabling time-triggered runtime verification for C programs (SN, YJ, CWWW, SB, RM, BB, SF), pp. 603–606.
ESEC-FSE-2013-NguyenNNN #semantics #statistics: A statistical semantic language model for source code (TTN, ATN, HAN, TNN), pp. 532–542.
ICSE-2013-Guerrouj #comprehension #normalisation #quality: Normalizing source code vocabulary to support program comprehension and software quality (LG), pp. 1385–1388.
ICSE-2013-HaiducRBOLM #code search #predict #quality #query: Query quality prediction and reformulation for source code search: the refoqus tool (SH, GDR, GB, RO, ADL, AM), pp. 1307–1310.
ICSE-2013-HaoLM0J #multi #named: MCT: a tool for commenting programs by multimedia comments (YH, GL, LM, LZ, ZJ), pp. 1339–1342.
ICSE-2013-Leino: Developing verified programs with dafny (KRML), pp. 1488–1490.
ICSE-2013-LiZLXLLX #distributed: A characteristic study on failures of production distributed data-parallel programs (SL, HZ, HL, TX, HL, WL, TX), pp. 963–972.
ICSE-2013-MarinoHDVTV #concurrent #detection: Detecting deadlock in programs with data-centric synchronization (DM, CH, JD, MV, FT, JV), pp. 322–331.
ICSE-2013-Park #comprehension #concurrent #fault: Fault comprehension for concurrent programs (SP), pp. 1444–1446.
ICSE-2013-Zeid #contest #evaluation #framework #integration #re-engineering #student: A framework to evaluate software engineering student contests: evaluation and integration with academic programs (AZ), pp. 1083–1089.
SAC-2013-AlitavoliJE #java #novel: A novel watermarking method for Java programs (MA, MJ, AE), pp. 1013–1018.
SAC-2013-ChenLWW #abstraction #static analysis: Static analysis of list-manipulating programs via bit-vectors and numerical abstractions (LC, RL, XW, JW), pp. 1204–1210.
SAC-2013-DelahayeKS #c #dynamic analysis #specification: Common specification language for static and dynamic analysis of C programs (MD, NK, JS), pp. 1230–1235.
SAC-2013-GouwBJW #case study #industrial #java #runtime: Run-time checking of data- and protocol-oriented properties of Java programs: an industrial case study (SdG, FSdB, EBJ, PYHW), pp. 1573–1578.
SAC-2013-MoriguchiW #interactive #reuse: An interactive extension mechanism for reusing verified programs (SM, TW), pp. 1236–1243.
LDTA-J-2009-ChilowiczDR #sequence: Viewing functions as token sequences to highlight similarities in source code (MC, ÉD, GR), pp. 1871–1891.
LDTA-J-2009-LammelTK #fault #programming #traversal: Programming errors in traversal programs over structured data (RL, SJT, MK), pp. 1770–1808.
GPCE-2013-0001RN #abstract syntax tree #declarative #fine-grained #mining: Declarative visitors to ease fine-grained source code mining with full history on billions of AST nodes (RD, HR, TNN), pp. 23–32.
ASPLOS-2013-LuciaC #empirical #parallel #thread: Cooperative empirical failure avoidance for multithreaded programs (BL, LC), pp. 39–50.
ASPLOS-2013-SchulteDWF #assembly #automation #embedded: Automated repair of binary and assembly programs for cooperating embedded devices (EMS, JD, WW, SF), pp. 317–328.
CGO-2013-ChoKWLLM #concurrent: Practical lock/unlock pairing for concurrent programs (HKC, TK, YW, SL, HL, SAM), p. 12.
CGO-2013-GreweWO #parallel: Portable mapping of data parallel programs to OpenCL for heterogeneous systems (DG, ZW, MFPO), p. 10.
CGO-2013-RodriguesCP #integer #performance: A fast and low-overhead technique to secure programs against integer overflows (RER, VHSC, FMQP), p. 11.
CGO-2013-TanFG #detection #fault #lightweight: Lightweight fault detection in parallelized programs (LT, MF, RG), p. 11.
PPoPP-2013-AcarCR #parallel #scheduling: Scheduling parallel programs by work stealing with private deques (UAA, AC, MR), pp. 219–228.
PPoPP-2013-CaiZWC #detection #named #parallel #thread: TeamWork: synchronizing threads globally to detect real deadlocks for multithreaded programs (YC, KZ, SW, WKC), pp. 311–312.
PPoPP-2013-ParkSI #concurrent #detection #scalability: Scalable data race detection for partitioned global address space programs (CSP, KS, CI), pp. 305–306.
PPoPP-2013-YukiFRS #analysis #array #data flow: Array dataflow analysis for polyhedral X10 programs (TY, PF, SVR, VS), pp. 23–34.
ESOP-2013-BouajjaniEEH #concurrent #specification #verification: Verifying Concurrent Programs against Sequential Specifications (AB, ME, CE, JH), pp. 290–309.
ESOP-2013-FilliatreP #named #proving #why: Why3 — Where Programs Meet Provers (JCF, AP), pp. 125–128.
ESOP-2013-KobayashiI #higher-order #model checking #recursion: Model-Checking Higher-Order Programs with Recursive Types (NK, AI), pp. 431–450.
FoSSaCS-2013-HofmannRS #morphism #pointer: Pure Pointer Programs and Tree Isomorphism (MH, RR, US), pp. 321–336.
TACAS-2013-BhatBGR #functional #probability: Deriving Probability Density Functions from Probabilistic Functional Programs (SB, JB, ADG, CVR), pp. 508–522.
TACAS-2013-FalkeMS #bound #c #contest #model checking #named #using: LLBMC: Improved Bounded Model Checking of C Programs Using LLVM — (Competition Contribution) (SF, FM, CS), pp. 623–626.
TACAS-2013-GantyIK #approximate #integer #summary: Underapproximation of Procedure Summaries for Integer Programs (PG, RI, FK), pp. 245–259.
TACAS-2013-GodefroidY #analysis: Analysis of Boolean Programs (PG, MY), pp. 214–229.
TACAS-2013-PopeeaR #concurrent #contest #multi #named #thread #verification: Threader: A Verifier for Multi-threaded Programs — (Competition Contribution) (CP, AR), pp. 633–636.
CADE-2013-HawblitzelKLR #automation #proving #theorem proving #towards #using: Towards Modularly Comparing Programs Using Automated Theorem Provers (CH, MK, SKL, HR), pp. 282–299.
CAV-2013-BarnatBHHKLRSW #c #c++ #model checking #parallel #thread: DiVinE 3.0 — An Explicit-State Model Checker for Multithreaded C & C++ Programs (JB, LB, VH, JH, JK, ML, PR, VS, JW), pp. 863–868.
CAV-2013-KroeningLW #approximate #c #detection #performance: Under-Approximating Loops in C Programs for Fast Counterexample Detection (DK, ML, GW), pp. 381–396.
CAV-2013-WonischSW #proving: Programs from Proofs — A PCC Alternative (DW, AS, HW), pp. 912–927.
ICLP-J-2013-LiangK #analysis #logic programming #scalability: A practical analysis of non-termination in large logic programs (SL, MK), pp. 705–719.
ICLP-J-2013-YouZZ #logic programming #quantifier: Disjunctive logic programs with existential quantification in rule heads (JHY, HZ, YZ), pp. 563–578.
ICST-2013-BagnaraCGG #float #generative #testing: Symbolic Path-Oriented Test Data Generation for Floating-Point Programs (RB, MC, RG, AG), pp. 1–10.
ICST-2013-ChristakisGS #concurrent #detection #erlang #fault #testing: Systematic Testing for Detecting Concurrency Errors in Erlang Programs (MC, AG, KFS), pp. 154–163.
ICTSS-2013-SapraMCGC #execution #fault #python #symbolic computation #using: Finding Errors in Python Programs Using Dynamic Symbolic Execution (SS, MM, SC, AG, EMC), pp. 283–289.
ISSTA-2013-BindalBL #bound #concurrent #parallel #testing #thread: Variable and thread bounding for systematic testing of multithreaded programs (SB, SB, AL), pp. 145–155.
ISSTA-2013-HanazumiM #generative #java: Generation of Java programs properties from test purposes (SH, ACVdM), pp. 362–365.
ISSTA-2013-LuoR #named #parallel #runtime #thread: EnforceMOP: a runtime property enforcement system for multithreaded programs (QL, GR), pp. 156–166.
TAP-2013-CaballeroMRT #debugging #declarative #erlang: A Declarative Debugger for Sequential Erlang Programs (RC, EMM, AR, ST), pp. 96–114.
TAP-2013-KosmatovPS #proving #tutorial: A Lesson on Proof of Programs with Frama-C. Invited Tutorial Paper (NK, VP, JS), pp. 168–177.
VMCAI-2013-ChakiGKS #composition: Compositional Sequentialization of Periodic Programs (SC, AG, SK, OS), pp. 536–554.
CSEET-2012-AroraG #collaboration #learning #programming: Learning to Write Programs with Others: Collaborative Quadruple Programming (RA, SG), pp. 32–41.
CSEET-2012-Kajko-Mattsson #design #education #re-engineering: A Method for Designing Software Engineering Educational Programs (MKM), pp. 139–143.
ITiCSE-2012-Moreno #comparison #evaluation #framework: A qualitative framework for comparison and evaluation of computer science doctoral programs (MdCCM), p. 398.
ITiCSE-2012-PoonSTK #corpus #detection: Instructor-centric source code plagiarism detection and plagiarism corpus (JYHP, KS, YFT, MYK), pp. 122–127.
ITiCSE-2012-Ragonis #algorithm #education: Integrating the teaching of algorithmic patterns into computer science teacher preparation programs (NR), pp. 339–344.
SIGITE-2012-ZhangRRBW #health: Developing and improving interdisciplinary health information technology certificate programs (CZ, HR, BR, BB, AJAW), pp. 43–48.
CSMR-2012-BettenburgTH #code search #fuzzy #using: Using Fuzzy Code Search to Link Code Fragments in Discussions to Source Code (NB, SWT, AEH), pp. 319–328.
CSMR-2012-ShahDM: Making Smart Moves to Untangle Programs (SMAS, JD, CM), pp. 359–364.
CSMR-2012-YoshidaKI #approach #functional #maintenance #metric: A Cohesion Metric Approach to Dividing Source Code into Functional Segments to Improve Maintainability (NY, MK, HI), pp. 365–370.
CSMR-2012-ZiadiFSZ #identification: Feature Identification from the Source Code of Product Variants (TZ, LF, MAAdS, MZ), pp. 417–422.
ICPC-2012-CorleyKK #modelling #topic: Modeling the ownership of source code topics (CSC, EAK, NAK), pp. 173–182.
ICPC-2012-IshioEI #data flow #interprocedural #lightweight #visualisation: A lightweight visualization of interprocedural data-flow paths for source code reading (TI, SE, KI), pp. 37–46.
ICPC-2012-Keivanloo #clone detection #code search #detection: Leveraging clone detection for Internet-scale source code search (IK), pp. 277–280.
ICPC-2012-LuciaPOPP #information retrieval #question #using: Using IR methods for labeling source code artifacts: Is it worthwhile? (ADL, MDP, RO, AP, SP), pp. 193–202.
ICPC-2012-PanichellaAPMC #developer #mining: Mining source code descriptions from developer communications (SP, JA, MDP, AM, GC), pp. 63–72.
ICPC-2012-SharafiSGA #identifier #women: Women and men — Different but equal: On the impact of identifier style on source code reading (ZS, ZS, YGG, GA), pp. 27–36.
ICSM-2012-HamiltonD #community #dependence: Dependence communities in source code (JH, SD), pp. 579–582.
ICSM-2012-HayashiOZMS #refactoring: Refactoring edit history of source code (SH, TO, TZ, KM, MS), pp. 617–620.
ICSM-2012-KuangMHGHJE #comprehension #dependence #question #requirements #traceability: Do data dependencies in source code complement call dependencies for understanding requirements traceability? (HK, PM, HH, AG, LH, JL, AE), pp. 181–190.
ICSM-2012-KumarSS #c++: Rejuvenating C++ programs through demacrofication (AK, AS, BS), pp. 98–107.
ICSM-2012-QiML #automation #performance #scalability #using: Making automatic repair for large-scale programs more efficient using weak recompilation (YQ, XM, YL), pp. 254–263.
ICSM-2012-RamaKVP #detection #version control: Version history based source code plagiarism detection in proprietary systems (GMR, DK, SAV, SP), pp. 609–612.
SCAM-2012-LazarescuL #analysis #c #dependence #parallel: Dynamic Trace-Based Data Dependency Analysis for Parallelization of C Programs (MTL, LL), pp. 126–131.
WCRE-2012-FavreLLSV #documentation: Linking Documentation and Source Code in a Software Chrestomathy (JMF, RL, ML, TS, AV), pp. 335–344.
WCRE-2012-HemelK #case study #clone detection #detection #linux #reverse engineering #using #variability: Reverse Engineering Variability in Source Code Using Clone Detection: A Case Study for Linux Variants of Consumer Electronic Devices (AH, RK), pp. 357–366.
WCRE-2012-IchiiMNCO #approach #automation #modelling #rule-based: A Rule-based Automated Approach for Extracting Models from Source Code (MI, TM, YN, MC, HO), pp. 308–317.
WCRE-2012-RomanoRPK #fine-grained #using: Analyzing the Impact of Antipatterns on Change-Proneness Using Fine-Grained Source Code Changes (DR, PR, MP, FK), pp. 437–446.
ICALP-v1-2012-GuptaN #approximate #integer #online: Approximating Sparse Covering Integer Programs Online (AG, VN), pp. 436–448.
ICALP-v1-2012-MolinaroR #geometry #linear #online: Geometry of Online Packing Linear Programs (MM, RR), pp. 701–713.
IFM-2012-DongolH #multi #reasoning: Rely/Guarantee Reasoning for Teleo-reactive Programs over Multiple Time Bands (BD, IJH), pp. 39–53.
IFM-2012-JiB #java #named: PE-KeY: A Partial Evaluator for Java Programs (RJ, RB), pp. 283–295.
IFM-2012-LensinkSE #concurrent #framework #proving: A Proof Framework for Concurrent Programs (LL, SS, MCJDvE), pp. 174–190.
SEFM-2012-AmighiGGH #control flow #exception #graph #java: Sound Control-Flow Graph Extraction for Java Programs with Exceptions (AA, PdCG, DG, MH), pp. 33–47.
SEFM-2012-ZhuXMQQ #approach #concurrent #verification: The Rely/Guarantee Approach to Verifying Concurrent BPEL Programs (HZ, QX, CM, SQ, ZQ), pp. 172–187.
FLOPS-2012-Terauchi #automation #functional #higher-order #verification: Automated Verification of Higher-Order Functional Programs (TT), p. 2.
Haskell-2012-FarmerGKS #haskell #interactive #plugin: The HERMIT in the machine: a plugin for the interactive transformation of GHC core language programs (AF, AG, EK, NS), pp. 1–12.
ICFP-2012-EarlSMH #analysis #automaton #higher-order: Introspective pushdown analysis of higher-order programs (CE, IS, MM, DVH), pp. 177–188.
ICFP-2012-PereraACL #functional: Functional programs that explain their work (RP, UAA, JC, PBL), pp. 365–376.
ICFP-2012-SimoesVFJH #analysis #automation #functional #lazy evaluation #memory management: Automatic amortised analysis of dynamic memory allocation for lazy functional programs (HRS, PBV, MF, SJ, KH), pp. 165–176.
IFL-2012-Magalhaes #optimisation: Optimisation of Generic Programs Through Inlining (JPM), pp. 104–121.
CIG-2012-FradeVC #assessment #database: Aesthetic Terrain Programs database for creativity assessment (MF, FFdV, CC), pp. 350–354.
ICGT-2012-Poskitt #graph #verification: Verification of Graph Programs (CMP), pp. 420–422.
KR-2012-BahmaniBKL #declarative #dependence #set: Declarative Entity Resolution via Matching Dependencies and Answer Set Programs (ZB, LEB, SK, LVSL).
KR-2012-Feier #logic programming #reasoning #worst-case: Worst-Case Optimal Reasoning with Forest Logic Programs (CF).
KR-2012-GottlobS #datalog #ontology #query #recursion: Rewriting Ontological Queries into Small Nonrecursive Datalog Programs (GG, TS).
KR-2012-LeoneMTV: Efficiently Computable Datalog∃ Programs (NL, MM, GT, PV).
KR-2012-Lifschitz #logic programming: Logic Programs with Intensional Functions (VL).
KR-2012-OetschPPST #on the #testing: On the Small-Scope Hypothesis for Testing Answer-Set Programs (JO, MP, JP, MS, HT).
KR-2012-SlotaL #equivalence #modelling #robust #semantics: Robust Equivalence Models for Semantic Updates of Answer-Set Programs (MS, JL).
KR-2012-WangZZZ #equivalence #logic programming: Forgetting in Logic Programs under Strong Equivalence (YW, YZ, YZ, MZ).
SEKE-2012-dArceGCE #aspect-oriented #coordination #visualisation: Coordination Model to Support Visualization of Aspect-Oriented Programs (ÁFd, REG, RCMC, DME), pp. 168–173.
SEKE-2012-HumairaSOWF #framework #metric #multi #programming language #towards: Towards a Unified Source Code Measurement Framework Supporting Multiple Programming Languages (RH, KS, AO, HW, YF), pp. 480–485.
SEKE-2012-MeloSS #effectiveness #evaluation #parallel #testing #thread: Structural Testing for Multithreaded Programs: An Experimental Evaluation of the Cost, Strength and Effectiveness (SMM, SdRSdS, PSLdS), pp. 476–479.
SEKE-2012-QiXW #concurrent #graph #interprocedural #reachability #slicing: Slicing Concurrent Interprocedural Programs Based on Program Reachability Graphs (XQ, XX, PW), pp. 293–298.
SEKE-2012-RebeloLMOR #aspect-oriented #contract: Enforcing Contracts for Aspect-oriented programs with Annotations, Pointcuts and Advice (HR, RMFL, AM, CALO, MR), pp. 148–153.
MoDELS-2012-GravinoRST #comprehension #design pattern #developer #documentation #replication: Do Professional Developers Benefit from Design Pattern Documentation? A Replication in the Context of Source Code Comprehension (CG, MR, GS, GT), pp. 185–201.
PLEASE-2012-Duszynski0 #variability: Recovering variability information from the source code of similar software products (SD, MB), pp. 37–40.
ECOOP-2012-DiasDSL #java #memory management #transaction #verification: Verification of Snapshot Isolation in Transactional Memory Java Programs (RJD, DD, JCS, JL), pp. 640–664.
ECOOP-2012-NegaraVCJD #evolution #question #version control: Is It Dangerous to Use Version Control Histories to Study Source Code Evolution? (SN, MV, NC, REJ, DD), pp. 79–103.
OOPSLA-2012-HuangZ12a #concurrent #execution: Execution privatization for scheduler-oblivious concurrent programs (JH, CZ), pp. 737–752.
OOPSLA-2012-MeawadRMV #automation #exclamation #javascript: Eval begone!: semi-automated removal of eval from javascript programs (FM, GR, FM, JV), pp. 607–620.
OOPSLA-2012-MishneSY #code search #semantics: Typestate-based semantic code search over partial programs (AM, SS, EY), pp. 997–1016.
OOPSLA-2012-ParizekL #abstraction #java: Predicate abstraction of Java programs with collections (PP, OL), pp. 75–94.
OOPSLA-2012-PrountzosMP #concurrent #graph #named: Elixir: a system for synthesizing concurrent graph programs (DP, RM, KP), pp. 375–394.
OOPSLA-2012-YuNPP #named #parallel #testing #thread: Maple: a coverage-driven testing tool for multithreaded programs (JY, SN, CP, GP), pp. 485–502.
PLATEAU-2012-UrmaM #evolution #programming language #query: Programming language evolution via source code query languages (RGU, AM), pp. 35–38.
TOOLS-EUROPE-2012-DerezinskaR #c# #evaluation #object-oriented #quality #standard: Quality Evaluation of Object-Oriented and Standard Mutation Operators Applied to C# Programs (AD, MR), pp. 42–57.
AdaEurope-2012-FariaMP #ada #approach #model checking: An Approach to Model Checking Ada Programs (JMF, JM, JSP), pp. 105–118.
AdaEurope-2012-RuizCM #ada #development: Source Code as the Key Artifact in Requirement-Based Development: The Case of Ada 2012 (JFR, CC, YM), pp. 49–59.
HILT-2012-Leino: Developing verified programs with Dafny (KRML), pp. 9–10.
LOPSTR-2012-DandoisV #logic programming #semantics: Semantic Code Clones in Logic Programs (CD, WV), pp. 35–50.
LOPSTR-2012-GieslSSEF #evaluation #graph #logic programming #symbolic computation #term rewriting: Symbolic Evaluation Graphs and Term Rewriting — A General Methodology for Analyzing Logic Programs (JG, TS, PSK, FE, CF), p. 1.
LOPSTR-2012-Niwa0S: Improving Determinization of Grammar Programs for Program Inversion (MN, NN, MS), pp. 155–175.
LOPSTR-2012-Seki #logic programming #program transformation #proving: Proving Properties of Co-logic Programs with Negation by Program Transformations (HS), pp. 213–227.
PEPM-2012-Katayama #functional #induction #programming: An analytical inductive functional programming system that avoids unintended programs (SK), pp. 43–52.
PEPM-2012-KobayashiMS #functional: Functional programs as compressed data (NK, KM, AS), pp. 121–130.
PLDI-2012-CarbinKMR #approximate #nondeterminism #proving: Proving acceptability properties of relaxed nondeterministic approximate programs (MC, DK, SM, MCR), pp. 169–180.
PLDI-2012-CarteyLM #domain-specific language: Synthesising graphics card programs from DSLs (LC, RL, OdM), pp. 121–132.
PLDI-2012-WuTHCY #analysis #parallel #precise: Sound and precise analysis of parallel programs through schedule specialization (JW, YT, GH, HC, JY), pp. 205–216.
POPL-2012-BouajjaniE #analysis #parallel #recursion: Analysis of recursively parallel programs (AB, ME), pp. 203–214.
POPL-2012-FarzanK #composition #concurrent #reasoning #verification: Verification of parameterized concurrent programs by modular reasoning about data and control (AF, ZK), pp. 297–308.
PPDP-2012-BacciCFV #automation #first-order #specification #synthesis: Automatic synthesis of specifications for first order curry programs (GB, MC, MAF, AV), pp. 25–34.
PPDP-2012-GieslSSEF #evaluation #graph #logic programming #symbolic computation #term rewriting: Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs (JG, TS, PSK, FE, CF), pp. 1–12.
PPDP-2012-MarpleBMG #execution #set: Goal-directed execution of answer set programs (KM, AB, RM, GG), pp. 35–44.
QAPL-2012-GazeauMP #analysis #float #robust: A non-local method for robustness analysis of floating point programs (IG, DM, CP), pp. 63–76.
SAS-2012-AbdullaACLR #abstraction #automation #integer: Automatic Fence Insertion in Integer Programs via Predicate Abstraction (PAA, MFA, YFC, CL, AR), pp. 164–180.
SAS-2012-CacheraJJK #imperative #invariant #polynomial: Inference of Polynomial Invariants for Imperative Programs: A Farewell to Gröbner Bases (DC, TPJ, AJ, FK), pp. 58–74.
SAS-2012-EmmiL #distributed: Finding Non-terminating Executions in Distributed Asynchronous Programs (ME, AL), pp. 439–455.
SAS-2012-Ledesma-GarzaR #analysis #functional #higher-order #reachability: Binary Reachability Analysis of Higher Order Functional Programs (RLG, AR), pp. 388–404.
SAS-2012-MadhavanRV #analysis #composition #higher-order: Modular Heap Analysis for Higher-Order Programs (RM, GR, KV), pp. 370–387.
RE-2012-CharradaKG #identification #requirements: Identifying outdated requirements based on source code changes (EBC, AK, MG), pp. 61–70.
ASE-2012-HarmanLJWAC #challenge #programming #search-based #using: The GISMOE challenge: constructing the pareto program surface using genetic programming to find better programs (MH, WBL, YJ, DRW, AA, JAC), pp. 1–14.
ASE-2012-KahkonenSH #automation #parallel #testing #thread #using: Using unfoldings in automated testing of multithreaded programs (KK, OS, KH), pp. 150–159.
ASE-2012-LiT #api #automation #erlang #migration #refactoring: Automated API migration in a user-extensible refactoring tool for Erlang programs (HL, SJT), pp. 294–297.
ASE-2012-LuciaLJB #evolution #named #testing: kbe-anonymity: test data anonymization for evolving programs (L, DL, LJ, AB), pp. 262–265.
ASE-2012-SongT #model checking #named: PuMoC: a CTL model-checker for sequential programs (FS, TT), pp. 346–349.
FSE-2012-EmmiLQ: Asynchronous programs with prioritized task-buffers (ME, AL, SQ), p. 48.
FSE-2012-FarzanMRS #concurrent #predict: Predicting null-pointer dereferences in concurrent programs (AF, PM, NR, FS), p. 47.
FSE-2012-GanaiLG #analysis #concurrent #multi #named #thread: DTAM: dynamic taint analysis of multi-threaded programs for relevancy (MKG, DL, AG), p. 46.
FSE-2012-ZhangKK #evolution #fault #impact analysis #java #named: FaultTracer: a change impact and regression fault analysis tool for evolving Java programs (LZ, MK, SK), p. 40.
ICSE-2012-Jaafar #analysis #evolution #on the: On the analysis of evolution of software artefacts and programs (FJ), pp. 1563–1566.
ICSE-2012-McMillanHPCM #agile #prototype #recommendation: Recommending source code for use in rapid software prototypes (CM, NH, DP, JCH, BM), pp. 848–858.
ICSE-2012-NguyenNNTNAN #code completion #graph: Graph-based pattern-oriented, context-sensitive source code completion (ATN, TTN, HAN, AT, HVN, JMAK, TNN), pp. 69–79.
ICSE-2012-Rodes #layout #stack #towards: Stack layout transformation: Towards diversity for securing binary programs (BR), pp. 1543–1546.
ICSE-2012-Stolee #lightweight #semantics #specification: Finding suitable programs: Semantic search with incomplete and lightweight specifications (KTS), pp. 1571–1574.
SAC-2012-CruzFP #verification: Verification conditions for single-assignment programs (DCdC, MJF, JSP), pp. 1264–1270.
SAC-2012-DandamudiWH #animation #comprehension #framework: An animation framework for improving the comprehension of TinyOS programs (SD, SKW, JOH), pp. 1625–1631.
SAC-2012-LavazzaMTT #empirical #java #open source #reliability: An empirical investigation of perceived reliability of open source Java programs (LL, SM, DT, DT), pp. 1109–1114.
SAC-2012-ZaraketNSJ #architecture #library #parallel #using: Portable Parallel Programs using architecture-aware libraries (FAZ, MN, MS, AJ), pp. 1922–1924.
CGO-2012-CampanoniJHRWB #automation #named #parallel: HELIX: automatic parallelization of irregular programs for chip multiprocessing (SC, TMJ, GHH, VJR, GYW, DMB), pp. 84–93.
CGO-2012-ZouR #detection #parallel: Scan detection and parallelization in “inherently sequential” nested loop programs (YZ, SVR), pp. 74–83.
DAC-2012-KumarBKV #analysis #predict #using: Early prediction of NBTI effects using RTL source code analysis (JAK, KMB, HK, SV), pp. 808–813.
DATE-2012-CongHLZZ #replication #streaming: Combining module selection and replication for throughput-driven streaming programs (JC, MH, BL, PZ, YZ), pp. 1018–1023.
ISMM-2012-InoueN #hardware #identification #java: Identifying the sources of cache misses in Java programs without relying on hardware counters (HI, TN), pp. 133–142.
ISMM-2012-SeweMSABRG #behaviour #comparison #java #memory management #scala: new Scala() instance of Java: a comparison of the memory behaviour of Java and Scala programs (AS, MM, AS, DA, WB, NPR, SZG), pp. 97–108.
LCTES-2012-FarhadKBS #deployment #multi: Profile-guided deployment of stream programs on multicores (SMF, YK, BB, BS), pp. 79–88.
LCTES-2012-YuYWCC #consistency #parallel: Symbolic consistency checking of OpenMp parallel programs (FY, SCY, FW, GCC, CCC), pp. 139–148.
PDP-2012-BorkowskiT #distributed #process: Global Control in Distributed Programs with Dynamic Process Membership (JB, MT), pp. 525–529.
PDP-2012-DaniASB #concurrent #named #parallel #predict #thread: TCP: Thread Contention Predictor for Parallel Programs (AMD, BA, YNS, CB), pp. 19–26.
PPoPP-2012-EomYJD #named #object-oriented: DOJ: dynamically parallelizing object-oriented programs (YHE, SY, JCJ, BD), pp. 85–96.
PPoPP-2012-NollG #framework #optimisation #parallel: An infrastructure for dynamic optimization of parallel programs (AN, TRG), pp. 325–326.
ESOP-2012-InoueT #multi #reasoning: Reasoning about Multi-stage Programs (JI, WT), pp. 357–376.
ESOP-2012-LuPZX #parallel #thread: A Type and Effect System for Determinism in Multithreaded Programs (YL, JP, CZ, JX), pp. 518–538.
FASE-2012-AlbertBGHR: Verified Resource Guarantees for Heap Manipulating Programs (EA, RB, SG, RH, GRD), pp. 130–145.
FoSSaCS-2012-BoveDS #automation #first-order #functional #interactive #reasoning: Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs (AB, PD, ASR), pp. 104–118.
STOC-2012-Belovs: Span programs for functions with constant-sized 1-certificates: extended abstract (AB), pp. 77–84.
STOC-2012-DvirMPY #branch #multi: Separating multilinear branching programs and formulas (ZD, GM, SP, AY), pp. 615–624.
TACAS-2012-BaslerDKKTW #c #contest #named #verification: satabs: A Bit-Precise Verifier for C Programs — (Competition Contribution) (GB, AFD, AK, DK, MT, TW), pp. 552–555.
TACAS-2012-BouajjaniE #analysis #bound #message passing: Bounded Phase Analysis of Message-Passing Programs (AB, ME), pp. 451–465.
TACAS-2012-DudkaMPV #contest #data type #linked data #named #open data #verification: Predator: A Verification Tool for Programs with Dynamic Linked Data Structures — (Competition Contribution) (KD, PM, PP, TV), pp. 545–548.
TACAS-2012-PopeeaR #composition #concurrent #multi #proving #termination #thread: Compositional Termination Proofs for Multi-threaded Programs (CP, AR), pp. 237–251.
CAV-2012-AtigBEL #detection #parallel #thread: Detecting Fair Non-termination in Multithreaded Programs (MFA, AB, ME, AL), pp. 210–226.
CAV-2012-BodikT #constraints #theorem proving: Synthesizing Programs with Constraint Solvers (RB, ET), p. 3.
CAV-2012-BrockschmidtMOG #automation #java #proving #termination: Automated Termination Proofs for Java Programs with Cyclic Data (MB, RM, CO, JG), pp. 105–122.
CAV-2012-ChaudhuriS #named #optimisation: Euler: A System for Numerical Optimization of Programs (SC, ASL), pp. 732–737.
CAV-2012-EsparzaGK #probability #proving #termination #using: Proving Termination of Probabilistic Programs Using Patterns (JE, AG, SK), pp. 123–138.
CAV-2012-HagueL #analysis #bound #parallel #thread: Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters (MH, AWL), pp. 260–276.
CAV-2012-KahlonW #concurrent: Lock Removal for Concurrent Trace Programs (VK, CW), pp. 227–242.
CAV-2012-KieferMOWW #named #probability: APEX: An Analyzer for Open Probabilistic Programs (SK, ASM, JO, BW, JW), pp. 693–698.
CAV-2012-LahiriHKR #imperative #named #semantics: SYMDIFF: A Language-Agnostic Semantic Diff Tool for Imperative Programs (SKL, CH, MK, HR), pp. 712–717.
CAV-2012-Schwartz-NarbonneLAM #debugging #named #parallel: passert: A Tool for Debugging Parallel Programs (DSN, FL, DIA, SM), pp. 751–757.
ICLP-2012-Balduccini #set: An Answer Set Solver for non-Herbrand Programs: Progress Report (MB), pp. 49–60.
ICLP-2012-GrecoST #logic programming #on the #termination: On the Termination of Logic Programs with Function Symbols (SG, FS, IT), pp. 323–333.
ICLP-2012-Lifschitz #logic programming: Two-Valued Logic Programs (VL), pp. 259–266.
ICLP-2012-NievesL #logic programming: Possibilistic Nested Logic Programs (JCN, HL), pp. 267–276.
ICLP-2012-OetschPT #constraints #semantics: An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions (JO, JP, HT), pp. 222–234.
ICLP-2012-YouMB #semantics: Reconciling Well-Founded Semantics of DL-Programs and Aggregate Programs (JHY, JM, YB), pp. 235–246.
ICLP-J-2012-Cervesato #compilation #logic programming: An Improved Proof-Theoretic Compilation of Logic Programs (IC), pp. 639–657.
ICLP-J-2012-IslamRR #logic programming #probability #random: Inference in probabilistic logic programs with continuous random variables (MAI, CRR, IVR), pp. 505–523.
ICLP-J-2012-Martin #logic programming #semantics: Contextual hypotheses and semantics of logic programs (EM), pp. 843–887.
ICLP-J-2012-Vidal #independence #logic programming #partial evaluation: Annotation of logic programs for independent AND-parallelism by partial evaluation (GV), pp. 583–600.
ICLP-J-2012-VosKOPT: Annotating answer-set programs in Lana (MDV, DGK, JO, JP, HT), pp. 619–637.
ICST-2012-ChittimalliS #framework #modelling #named: GEMS: A Generic Model Based Source Code Instrumentation Framework (PKC, VS), pp. 909–914.
ICST-2012-Kannavara #static analysis: Securing Opensource Code via Static Analysis (RK), pp. 429–436.
ICST-2012-PonsiniMR #abstract interpretation #analysis #constraints #float #programming: Combining Constraint Programming and Abstract Interpretation for Value Analysis of Floating-point Programs (OP, CM, MR), pp. 775–776.
ICST-2012-Wotawa #challenge #constraints #fault #open science #research #using: Open Research Challenges of Localizing Faults in Programs Using Constraints (FW), pp. 770–771.
IJCAR-2012-BoerBR #automation #pointer #recursion #verification: Automated Verification of Recursive Programs with Pointers (FSdB, MMB, JR), pp. 149–163.
ISSTA-2012-CoughlinCDS #what: Measuring enforcement windows with symbolic trace interpretation: what well-behaved programs say (DC, BYEC, AD, JGS), pp. 276–286.
ISSTA-2012-HongAPKH #concurrent #testing: Testing concurrent programs to achieve high synchronization coverage (SH, JA, SP, MK, MJH), pp. 210–220.
ISSTA-2012-ThiesB #java #named #refactoring: RefaFlex: safer refactorings for reflective Java programs (AT, EB), pp. 1–11.
VMCAI-2012-BouajjaniDES #abstract domain #automation #infinity #reasoning: Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data (AB, CD, CE, MS), pp. 1–22.
VMCAI-2012-ChakiGS #concurrent #multi #thread #verification: Regression Verification for Multi-threaded Programs (SC, AG, OS), pp. 119–135.
VMCAI-2012-CharltonHR #higher-order #named #verification: Crowfoot: A Verifier for Higher-Order Store Programs (NC, BH, BR), pp. 136–151.
VMCAI-2012-MorseVMM #c #message passing #modelling: Modeling Asynchronous Message Passing for C Programs (EM, NV, EM, JM), pp. 332–347.
VMCAI-2012-SiegelZ #execution #invariant #parallel #symbolic computation: Loop Invariant Symbolic Execution for Parallel Programs (SFS, TKZ), pp. 412–427.
VLDB-2011-HerodotouB #cost analysis #optimisation #pipes and filters #profiling: Profiling, What-if Analysis, and Cost-based Optimization of MapReduce Programs (HH, SB), pp. 1111–1122.
VLDB-2011-JahaniCR #automation #optimisation #pipes and filters: Automatic Optimization for MapReduce Programs (EJ, MJC, CR), pp. 385–396.
CSEET-2011-GimenesBB #distance #learning #re-engineering: International workshop on distance learning support for postgraduate programs in software engineering (e-gradSE) (IMdSG, LB, EFB), pp. 517–519.
ITiCSE-2011-BarrosBV #java #named #object-oriented #programming #sequence #visualisation: Java2Sequence: a tool for the visualization of object-oriented programs in introductory programming (JPB, LB, MV), p. 369.
ITiCSE-2011-LangCPEA #student: Outreach programs to promote computer science and ict to high school and middle school students (CL, AC, JP, MALE, RA), pp. 344–345.
ITiCSE-2011-VirsedaM #debugging #education #semantics #verification: An innovative teaching tool based on semantic tableaux for verification and debugging of programs (RdVV, FPM), p. 352.
SIGITE-2011-McGill #framework #game studies: Motivations and informing frameworks of game degree programs in the United Kingdom and the United States (MM), pp. 67–72.
SIGITE-2011-RoweLH #assessment #framework #identification: An assessment framework for identifying information technology programs (DCR, BML, CRGH), pp. 123–128.
SCAM-J-2009-Giffhorn11 #concurrent: Advanced chopping of sequential and concurrent programs (DG), pp. 239–294.
CSMR-2011-HayaseKMI: Building Domain Specific Dictionaries of Verb-Object Relation from Source Code (YH, YK, YM, KI), pp. 93–100.
ICPC-2011-BurrowsTGF #aspect-oriented #evaluation #fault #reasoning: Reasoning about Faults in Aspect-Oriented Programs: A Metrics-Based Evaluation (RB, FT, AG, FCF), pp. 131–140.
ICPC-2011-CordyR #named #open source #performance: DebCheck: Efficient Checking for Open Source Code Clones in Software Systems (JRC, CKR), pp. 217–218.
ICPC-2011-EitanGHMW #comprehension #on the #visualisation: On Visualization and Comprehension of Scenario-Based Programs (NE, MG, DH, AM, GW), pp. 189–192.
ICPC-2011-PanchenkoKPZ #database #precise #query #scalability #using: Precise and Scalable Querying of Syntactical Source Code Patterns Using Sample Code Snippets and a Database (OP, JK, HP, AZ), pp. 41–50.
ICPC-2011-ScannielloM #clustering #concept: Clustering Support for Static Concept Location in Source Code (GS, AM), pp. 1–10.
ICPC-2011-Storey #interactive #java #revisited #visualisation: An Interactive Visualization Environment for Exploring Java Programs: SHriMP Views Revisited (MADS), p. xviii.
ICSM-2011-BiggersEKE #metric #towards: Toward a metrics suite for source code lexicons (LRB, BPE, NAK, LHE), pp. 492–495.
ICSM-2011-JiresalCN #cobol #detection #precise #scalability: Precise detection of un-initialized variables in large, real-life COBOL programs in presence of unrealizable paths (RJ, AC, RN), pp. 448–456.
ICSM-2011-LawrieB #identifier: Expanding identifiers to normalize source code vocabulary (DL, DB), pp. 113–122.
ICSM-2011-NishizonoMVM #comprehension #empirical #evolution #industrial #maintenance #metric #predict: Source code comprehension strategies and metrics to predict comprehension effort in software maintenance and evolution tasks — an empirical study with industry practitioners (KN, SM, RV, KiM), pp. 473–481.
ICSM-2011-RastkarMB #generative #natural language #summary: Generating natural language summaries for crosscutting source code concerns (SR, GCM, AWJB), pp. 103–112.
ICSM-2011-RomanoP #interface #java #metric #predict #using: Using source code metrics to predict change-prone Java interfaces (DR, MP), pp. 303–312.
ICSM-2011-RomanoSRG #clustering #design pattern: Clustering and lexical information support for the recovery of design pattern in source code (SR, GS, MR, CG), pp. 500–503.
ICSM-2011-Roover #detection #logic #metaprogramming #object-oriented: A logic meta-programming foundation for example-driven pattern detection in object-oriented programs (CDR), pp. 556–561.
ICSM-2011-Scanniello: Source code survival with the Kaplan Meier (GS), pp. 524–527.
ICSM-2011-WieseHH #comparison #identifier: A comparison of stemmers on source code identifiers for software search (AW, VH, EH), pp. 496–499.
MSR-2011-GermanD #challenge: Apples vs. oranges?: an exploration of the challenges of comparing the source code of two software systems (DMG, JD), pp. 246–249.
MSR-2011-GigerPG #debugging #fine-grained #predict: Comparing fine-grained source code changes and code churn for bug prediction (EG, MP, HCG), pp. 83–92.
MSR-2011-ThomasAHB #evolution #modelling #topic: Modeling the evolution of topics in source code histories (SWT, BA, AEH, DB), pp. 173–182.
SCAM-2011-AbebeHTM #concept #smell: The Effect of Lexicon Bad Smells on Concept Location in Source Code (SLA, SH, PT, AM), pp. 125–134.
SCAM-2011-Gold #analysis #music #programming: Knitting Music and Programming: Reflections on the Frontiers of Source Code Analysis (NG), pp. 10–14.
SCAM-2011-NicolayRMJ #automation #higher-order #parallel: Automatic Parallelization of Side-Effecting Higher-Order Scheme Programs (JN, CDR, WDM, VJ), pp. 185–194.
WCRE-2011-AliGA #clustering #object-oriented #requirements #traceability: Requirements Traceability for Object Oriented Systems by Partitioning Source Code (NA, YGG, GA), pp. 45–54.
WCRE-2011-DuszynskiKB #multi #reuse: Analyzing the Source Code of Multiple Software Variants for Reuse Potential (SD, JK, MB), pp. 303–307.
WCRE-2011-GrantCS #analysis #concept #reverse engineering #using: Reverse Engineering Co-maintenance Relationships Using Conceptual Analysis of Source Code (SG, JRC, DBS), pp. 87–91.
WCRE-2011-GravinoRST #comprehension #design pattern #documentation: Does the Documentation of Design Pattern Instances Impact on Source Code Comprehension? Results from Two Controlled Experiments (CG, MR, GS, GT), pp. 67–76.
WCRE-2011-HaslingerLE #feature model #modelling #reverse engineering #set: Reverse Engineering Feature Models from Programs’ Feature Sets (ENH, RELH, AE), pp. 308–312.
WCRE-2011-KellensRNSJ #evolution #quantifier #reasoning #using: Reasoning over the Evolution of Source Code Using Quantified Regular Path Expressions (AK, CDR, CN, RS, VJ), pp. 389–393.
WCRE-2011-NonnenSI #research: Locating the Meaning of Terms in Source Code Research on “Term Introduction” (JN, DS, PI), pp. 99–108.
WCRE-2011-Panchenko #code search #database #in memory: In-Memory Database Support for Source Code Search and Analytics (OP), pp. 421–424.
WCRE-2011-ScholzK #multi #protocol #thread: Object-Based Dynamic Protocol Recovery for Multi-Threading Programs (BS, RK), pp. 251–260.
ICALP-v1-2011-AllenderW #algebra #branch #on the #power of: On the Power of Algebraic Branching Programs of Width Two (EA, FW), pp. 736–747.
ICALP-v2-2011-BrazdilKKV #analysis #bound #probability #recursion #runtime: Runtime Analysis of Probabilistic Programs with Unbounded Recursion (TB, SK, AK, IHV), pp. 319–331.
FM-2011-BartheCK #relational #using #verification: Relational Verification Using Product Programs (GB, JMC, CK), pp. 200–214.
FM-2011-GherghinaDQC #specification #verification: Structured Specifications for Better Verification of Heap-Manipulating Programs (CG, CD, SQ, WNC), pp. 386–401.
RTA-2011-BrockschmidtOG #bytecode #composition #java #proving #recursion #term rewriting #termination: Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting (MB, CO, JG), pp. 155–170.
RTA-2011-FalkeKS #analysis #c #compilation #termination #using: Termination Analysis of C Programs Using Compiler Intermediate Languages (SF, DK, CS), pp. 41–50.
RTA-2011-Weirich #proving: Combining Proofs and Programs (SW), p. 9.
SEFM-2011-TschannenFNM #object-oriented #verification: Usable Verification of Object-Oriented Programs by Combining Static and Dynamic Techniques (JT, CAF, MN, BM), pp. 382–398.
TLCA-2011-Weirich #proving: Combining Proofs and Programs (SW), p. 9.
CEFP-2011-Butterfield #functional #reasoning: Reasoning about I/O in Functional Programs (AB), pp. 93–141.
ICFP-2011-Chargueraud #imperative #verification: Characteristic formulae for the verification of imperative programs (AC), pp. 418–430.
ICFP-2011-ChenDHA #functional #self: Implicit self-adjusting computation for purely functional programs (YC, JD, MAH, UAA), pp. 129–141.
IFL-2011-MiddelkoopEP #functional: Functional Instrumentation of ActionScript Programs with Asil (AM, ABE, WP), pp. 1–16.
IFL-2011-ReichNR #canonical #generative #lazy evaluation: Lazy Generation of Canonical Test Programs (JSR, MN, CR), pp. 69–84.
DiGRA-2011-ZagalS #education #game studies #overview: A Survey of Final Project Courses in Game Programs: Considerations for Teaching Capstone (JPZ, JS).
GCM-2010-PlumpSS11 #automaton #finite #graph: Minimizing Finite Automata with Graph Programs (DP, RS, AS).
HIMI-v1-2011-WuS #abstraction #visualisation: Visualizing Programs on Different Levels of Abstractions (JHW, JS), pp. 66–75.
VISSOFT-2011-LonnbergBM #concurrent #dependence #graph #visualisation: Visualising concurrent programs with dynamic dependence graphs (JL, MBA, LM), pp. 1–4.
ICEIS-v3-2011-JuniorNI #execution #identification #legacy #overview: Survey and Proposal of a Method for Business Rules Identification in Legacy Systems Source Code and Execution Logs (WARJ, GSdN, CI), pp. 207–213.
ICML-2011-RoyLM #bound #polynomial: From PAC-Bayes Bounds to Quadratic Programs for Majority Votes (JFR, FL, MM), pp. 649–656.
SEKE-2011-YooLJC #independence #named: FBDtoVerilog: A Vendor-Independent Translation from FBDs into Verilog Programs (JY, JHL, SJ, SDC), pp. 48–51.
BX-2011-Cleve #co-evolution #using: Co-evolving schemas and programs using coupled transformations (AC), p. 54.
ECOOP-2011-ZhangXZZC #estimation #object-oriented: Frequency Estimation of Virtual Call Targets for Object-Oriented Programs (CZ, HX, SZ, JZ, YC), pp. 510–532.
OOPSLA-2011-JeonGLT #named #parallel: Kismet: parallel speedup estimates for serial programs (DJ, SG, CML, MBT), pp. 519–536.
TOOLS-EUROPE-2011-TrudelOFN #automation #eiffel #java: Automated Translation of Java Source Code to Eiffel (MT, MO, CAF, MN), pp. 20–35.
PEPM-J-2007-CunhaV11 #query #xpath: Transformation of structure-shy programs with application to XPath queries and strategic functions (AC, JV), pp. 516–539.
AdaEurope-2011-CoqR #ada #analysis #modelling #quality: The SQALE Quality and Analysis Models for Assessing the Quality of Ada Source Code (TC, JPR), pp. 61–74.
AdaEurope-2011-RazaFP #detection #fault #parallel: Detecting High-Level Synchronization Errors in Parallel Programs (SAR, SF, EP), pp. 17–30.
LOPSTR-2011-DandoisV #detection #how #logic programming: Clones in Logic Programs and How to Detect Them (CD, WV), pp. 90–105.
LOPSTR-2011-Gallagher #analysis #logic programming #using: Analysis of Logic Programs Using Regular Tree Languages — (JPG), pp. 1–3.
LOPSTR-2011-Seki #logic programming #proving: Proving Properties of Co-Logic Programs by Unfold/Fold Transformations (HS), pp. 205–220.
LOPSTR-2011-SneyersS #probability #termination: Probabilistic Termination of CHRiSM Programs (JS, DDS), pp. 221–236.
PADL-2011-MeraTLH #debugging #logic programming #performance #profiling #runtime: Profiling for Run-Time Checking of Computational Properties and Performance Debugging in Logic Programs (EM, TT, PLG, MVH), pp. 38–53.
PEPM-2011-Caballero #functional #logic programming #program transformation: A program transformation for returning states in functional-logic programs (RC), pp. 111–120.
PEPM-2011-FernandesSSV #strict: Strictification of circular programs (JPF, JS, DS, JV), pp. 131–140.
PEPM-2011-Rinard #bound #probability #program analysis #program transformation: Probabilistic accuracy bounds for perforated programs: a new foundation for program analysis and transformation (MCR), pp. 79–80.
PLDI-2011-BouajjaniDES #analysis #interprocedural #on the: On inter-procedural analysis of programs with lists and data (AB, CD, CE, MS), pp. 578–589.
PLDI-2011-Chlipala #logic #low level #verification: Mostly-automated verification of low-level programs in computational separation logic (AC), pp. 234–245.
PLDI-2011-DilligDAS #composition #precise #summary: Precise and compact modular procedure summaries for heap manipulating programs (ID, TD, AA, MS), pp. 567–577.
PLDI-2011-GulwaniJTV #synthesis: Synthesis of loop-free programs (SG, SJ, AT, RV), pp. 62–73.
PLDI-2011-PrasadAG #automation #compilation #execution #matlab: Automatic compilation of MATLAB programs for synergistic execution on heterogeneous processors (AP, JA, RG), pp. 152–163.
PLDI-2011-Sevcik #concurrent #optimisation: Safe optimisations for shared-memory concurrent programs (JS), pp. 306–316.
POPL-2011-AlurC #algorithm #streaming #transducer #verification: Streaming transducers for algorithmic verification of single-pass list-processing programs (RA, PC), pp. 599–610.
POPL-2011-ChoiAYT #multi #static analysis: Static analysis of multi-staged programs via unstaging translation (WC, BA, KY, MT), pp. 81–92.
POPL-2011-DilligDA #precise #reasoning #using: Precise reasoning for programs using containers (ID, TD, AA), pp. 187–200.
POPL-2011-EsparzaG #complexity #parallel #thread #verification: Complexity of pattern-based verification for multithreaded programs (JE, PG), pp. 499–510.
POPL-2011-GuptaPR #abstraction #concurrent #multi #refinement #thread #verification: Predicate abstraction and refinement for verifying multi-threaded programs (AG, CP, AR), pp. 331–344.
POPL-2011-OngR #algebra #data type #functional #higher-order #pattern matching #verification: Verifying higher-order functional programs with pattern-matching algebraic data types (CHLO, SJR), pp. 587–598.
POPL-2011-PrountzosMPM #analysis #graph #optimisation #parallel: A shape analysis for optimizing parallel graph programs (DP, RM, KP, KSM), pp. 159–172.
POPL-2011-SchwarzSVLM #protocol #static analysis: Static analysis of interrupt-driven programs synchronized via the priority ceiling protocol (MDS, HS, VV, PL, MMO), pp. 93–104.
PPDP-2011-NigamJLS #distributed #incremental #logic programming #maintenance: Maintaining distributed logic programs incrementally (VN, LJ, BTL, AS), pp. 125–136.
SAS-2011-BouajjaniEP #concurrent #on the: On Sequentializing Concurrent Programs (AB, ME, GP), pp. 129–145.
SAS-2011-HuangZ #concurrent #debugging #performance: An Efficient Static Trace Simplification Technique for Debugging Concurrent Programs (JH, CZ), pp. 163–179.
SAS-2011-MightH #abstract interpretation #concurrent #higher-order #product line #static analysis: A Family of Abstract Interpretations for Static Analysis of Concurrent Higher-Order Programs (MM, DVH), pp. 180–197.
SAS-2011-SchrammelJ #data flow #verification: Logico-Numerical Abstract Acceleration and Application to the Verification of Data-Flow Programs (PS, BJ), pp. 233–248.
SAS-2011-SuterKK #recursion #satisfiability: Satisfiability Modulo Recursive Programs (PS, ASK, VK), pp. 298–315.
SAS-2011-ZulegerGSV #abstraction #analysis #bound #imperative: Bound Analysis of Imperative Programs with the Size-Change Abstraction (FZ, SG, MS, HV), pp. 280–297.
ASE-2011-AnandH #execution #java #symbolic computation: Heap cloning: Enabling dynamic symbolic execution of java programs (SA, MJH), pp. 33–42.
ASE-2011-GethersKDP #adaptation #approach #impact analysis: An adaptive approach to impact analysis from change requests to source code (MG, HHK, BD, DP), pp. 540–543.
ASE-2011-HillPV #code search #natural language: Improving source code search with natural language phrasal representations of method signatures (EH, LLP, KVS), pp. 524–527.
ASE-2011-KhalekYZMK #alloy #java #named #specification #testing #using: TestEra: A tool for testing Java programs using alloy specifications (SAK, GY, LZ, DM, SK), pp. 608–611.
ASE-2011-KimmigMM #natural language #query: Querying source code with natural language (MK, MM, MM), pp. 376–379.
ASE-2011-LozanoKM #named #recommendation #search-based: Mendel: Source code recommendation based on a genetic metaphor (AL, AK, KM), pp. 384–387.
ASE-2011-MacleanIG #animation #correctness #functional #pointer: The CORE system: Animation and functional correctness of pointer programs (EM, AI, GG), pp. 588–591.
ASE-2011-MaderE #empirical #navigation #traceability: Do software engineers benefit from source code navigation with traceability? — An experiment in software change management (PM, AE), pp. 444–447.
ASE-2011-RobinsonEPAL #automation #generative #scalability #testing: Scaling up automated test generation: Automatically generating maintainable regression unit tests for programs (BR, MDE, JHP, VA, NL), pp. 23–32.
ASE-2011-WesongaMR #concurrent #fault #visualisation: Guided test visualization: Making sense of errors in concurrent programs (SW, EGM, NR), pp. 624–627.
ASE-2011-YuTN #detection #specification: Specifying and detecting meaningful changes in programs (YY, TTT, BN), pp. 273–282.
ESEC-FSE-2011-ChaudhuriGLN #proving #robust: Proving programs robust (SC, SG, RL, SN), pp. 102–112.
ESEC-FSE-2011-CsallnerFL #testing: New ideas track: testing mapreduce-style programs (CC, LF, CL), pp. 504–507.
ESEC-FSE-2011-InostrozaTB #aspect-oriented #composition #interface #reasoning: Join point interfaces for modular reasoning in aspect-oriented programs (MI, ÉT, EB), pp. 508–511.
ESEC-FSE-2011-NaudziunieneBDDGP #automation #ide #java #named #verification: jStar-eclipse: an IDE for automated verification of Java programs (DN, MB, DD, MD, RG, MJP), pp. 428–431.
ESEC-FSE-2011-SahaNDNSC #fault #locality: Fault localization for data-centric programs (DS, MGN, PD, VKN, VS, SC), pp. 157–167.
ICSE-2011-Lee #case study #haskell #refactoring: A case study on refactoring in Haskell programs (DYL), pp. 1164–1166.
ICSE-2011-McMillan: Searching, selecting, and synthesizing source code (CM), pp. 1124–1125.
ICSE-2011-SchaferSDT #flexibility #java #refactoring: Refactoring Java programs for flexible locking (MS, MS, JD, FT), pp. 71–80.
ICSE-2011-StaatsWH #revisited #testing: Programs, tests, and oracles: the foundations of testing revisited (MS, MWW, MPEH), pp. 391–400.
SAC-2011-BackP #invariant #proving #semantics: Semantics and proof rules of invariant based programs (RJB, VP), pp. 1658–1665.
SAC-2011-LiuCJ #aspect-oriented #impact analysis #object-oriented: Change impact analysis for object-oriented programs evolved to aspect-oriented programs (CHL, SLC, WLJ), pp. 59–65.
SAC-2011-RangasamyS #effectiveness #modelling #parallel #performance #petri net #thread: Petri net based performance modeling for effective DVFS for multithreaded programs (AR, YNS), pp. 647–648.
SAC-2011-SunLZTCW #dependence #impact analysis #object-oriented #using: Using lattice of class and method dependence for change impact analysis of object oriented programs (XS, BL, SZ, CT, XC, WW), pp. 1439–1444.
GPCE-2011-LiNN #diagrams #generative #geometry: Generation of geometric programs specified by diagrams (YL, GSNJ), pp. 63–72.
ASPLOS-2011-BurnimNS #parallel #semantics #specification #thread: Specifying and checking semantic atomicity for multithreaded programs (JB, GCN, KS), pp. 79–90.
ASPLOS-2011-FarhadKBS #approximate #architecture #distributed #manycore: Orchestration by approximation: mapping stream programs onto multicore architectures (SMF, YK, BB, BS), pp. 357–368.
CC-2011-RimsadP #analysis: Tainted Flow Analysis on e-SSA-Form Programs (AR, Md, FMQP), pp. 124–143.
DAC-2011-CheC #compilation #embedded #manycore #memory management: Compilation of stream programs onto scratchpad memory based embedded multicore processors through retiming (WC, KSC), pp. 122–127.
DAC-2011-KuoSR #analysis #performance #reachability #using: Efficient WCRT analysis of synchronous programs using reachability (MMYK, RS, PSR), pp. 480–485.
DATE-2011-AndalamRG #analysis: Pruning infeasible paths for tight WCRT analysis of synchronous programs (SA, PSR, AG), pp. 204–209.
DATE-2011-GeunsBBC #parallel: Parallelization of while loops in nested loop programs for shared-memory multiprocessor systems (SJG, MJGB, TB, HC), pp. 697–702.
DATE-2011-LiuV #analysis #generative #performance #validation: Efficient validation input generation in RTL by hybridized source code analysis (LL, SV), pp. 1596–1601.
HPDC-2011-ZhouKB #debugging #detection #locality #named #parallel #scalability #using: Vrisha: using scaling properties of parallel programs for bug detection and localization (BZ, MK, SB), pp. 85–96.
LCTES-2011-GamatieG #design #embedded #multi #performance #static analysis: Static analysis of synchronous programs in signal for efficient design of multi-clocked embedded systems (AG, LG), pp. 71–80.
PDP-2011-AchourAKN #automation #clustering #named #performance #predict #towards: MPI-PERF-SIM: Towards an Automatic Performance Prediction Tool of MPI Programs on Hierarchical Clusters (SA, MA, BK, WN), pp. 207–211.
PPoPP-2011-SiegelZ #automation #parallel #verification: Automatic formal verification of MPI-based parallel programs (SFS, TKZ), pp. 309–310.
PPoPP-2011-WuM #communication #named: ScalaExtrap: trace-based communication extrapolation for spmd programs (XW, FM), pp. 113–122.
PPoPP-2011-ZhengRQA #detection #gpu #named: GRace: a low-overhead mechanism for detecting data races in GPU programs (MZ, VTR, FQ, GA), pp. 135–146.
ESOP-2011-DeDN #analysis #data flow: Dataflow Analysis for Datarace-Free Programs (AD, DD, RN), pp. 196–215.
ESOP-2011-Mine #c #embedded #fault #parallel #runtime #static analysis: Static Analysis of Run-Time Errors in Embedded Critical Parallel C Programs (AM), pp. 398–418.
FASE-2011-LiT #clone detection #detection #erlang #incremental: Incremental Clone Detection and Elimination for Erlang Programs (HL, SJT), pp. 356–370.
FoSSaCS-2011-AxelsenG #question #what: What Do Reversible Programs Compute? (HBA, RG), pp. 42–56.
STOC-2011-DinitzK #linear: Directed spanners via flow-based linear programs (MD, RK), pp. 323–332.
TACAS-2011-KieferW #on the #parallel #probability #process: On Probabilistic Parallel Programs with Process Creation and Synchronisation (SK, DW), pp. 296–310.
CADE-2011-PayetS #android #static analysis: Static Analysis of Android Programs (ÉP, FS), pp. 439–445.
CADE-2011-Platzer #difference #hybrid #logic #probability: Stochastic Differential Dynamic Logic for Stochastic Hybrid Programs (AP), pp. 446–460.
CAV-2011-BrazdilKK #analysis #bound #performance #probability: Efficient Analysis of Probabilistic Programs with an Unbounded Counter (TB, SK, AK), pp. 208–224.
CAV-2011-CernyCHRS #concurrent #synthesis: Quantitative Synthesis for Concurrent Programs (PC, KC, TAH, AR, RS), pp. 243–259.
CAV-2011-DonaldsonKKW #abstraction #concurrent #symmetry: Symmetry-Aware Predicate Abstraction for Shared-Variable Concurrent Programs (AFD, AK, DK, TW), pp. 356–371.
CAV-2011-GuptaPR #concurrent #constraints #multi #named #thread #verification: Threader: A Constraint-Based Verifier for Multi-threaded Programs (AG, CP, AR), pp. 412–417.
CAV-2011-HagueL #data type #model checking #recursion: Model Checking Recursive Programs with Numeric Data Types (MH, AWL), pp. 743–759.
CAV-2011-JhalaMR #functional #named #using #verification: HMC: Verifying Functional Programs Using Abstract Interpreters (RJ, RM, AR), pp. 470–485.
CAV-2011-JoseM #fault #locality #named: Bug-Assist: Assisting Fault Localization in ANSI-C Programs (MJ, RM), pp. 504–509.
CAV-2011-LiGR #automation #c++ #execution #generative #named #symbolic computation #testing: KLOVER: A Symbolic Execution and Automatic Test Generation Tool for C++ Programs (GL, IG, SPR), pp. 609–615.
CSL-2011-Madhusudan: Synthesizing Reactive Programs (PM), pp. 428–442.
CSL-2011-ReusS #functional #logic: Relative Completeness for Logics of Functional Programs (BR, TS), pp. 470–480.
ICLP-2011-Herranz-NievaM #logic programming #object-oriented #specification #synthesis: Synthesis of Logic Programs from Object-Oriented Formal Specifications (ÁHN, JM), pp. 95–105.
ICLP-2011-Krennwallner #composition #logic programming: Promoting Modular Nonmonotonic Logic Programs (TK), pp. 274–279.
ICLP-2011-Kriener #logic programming #reasoning: Correct Reasoning about Logic Programs (JK), pp. 280–283.
ICLP-J-2011-AreiasR #evaluation #logic programming #on the: On combining linear-based strategies for tabled evaluation of logic programs (MA, RR), pp. 681–696.
ICLP-J-2011-CominiTV #concurrent #constraints: Abstract diagnosis for timed concurrent constraint programs (MC, LT, AV), pp. 487–502.
ICLP-J-2011-CruzR #evaluation #logic programming #performance #retrieval: Efficient instance retrieval of subgoals for subsumptive tabled evaluation of logic programs (FC, RR), pp. 697–712.
ICLP-J-2011-VoetsS #analysis #integer #logic programming: Non-termination analysis of logic programs with integer arithmetics (DV, DDS), pp. 521–536.
ICST-2011-LazaarGL #automation #constraints #framework: A Framework for the Automatic Correction of Constraint Programs (NL, AG, YL), pp. 319–326.
ICTSS-2011-MammarCJMO #c #detection #testing #using: Using Testing Techniques for Vulnerability Detection in C Programs (AM, ARC, WJ, WM, EMdO), pp. 80–96.
ISSTA-2011-AllwoodCE #haskell #testing: High coverage testing of Haskell programs (TORA, CC, SE), pp. 375–385.
ISSTA-2011-BurnimSS #concurrent #memory management #modelling #testing: Testing concurrent programs on relaxed memory models (JB, KS, CS), pp. 122–132.
LICS-2011-ChurchillLM #game studies #imperative #proving #semantics: Imperative Programs as Proofs via Game Semantics (MC, JL, GM), pp. 65–74.
LICS-2011-KrishnaswamiB #semantics: Ultrametric Semantics of Reactive Programs (NRK, NB), pp. 257–266.
TAP-2011-Gaudel #modelling #proving #testing: Checking Models, Proving Programs, and Testing Systems (MCG), pp. 1–13.
VMCAI-2011-BardinHV #context-free grammar #re-engineering: Refinement-Based CFG Reconstruction from Unstructured Programs (SB, PH, FV), pp. 54–69.
VMCAI-2011-GawlitzaLMSW #analysis #concurrent #process #reachability: Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation (TMG, PL, MMO, HS, AW), pp. 199–213.
ECSA-2010-ChardignyS #architecture #documentation #object-oriented #process: Software Architecture Recovery Process Based on Object-Oriented Source Code and Documentation (SC, AS), pp. 409–416.
QoSA-2010-DietrichMTS #composition #empirical #java: Barriers to Modularity — An Empirical Study to Assess the Potential for Modularisation of Java Programs (JD, CM, EDT, SMAS), pp. 135–150.
CSMR-2010-FokinTC #c++ #decompiler #re-engineering: Reconstruction of Class Hierarchies for Decompilation of C++ Programs (AF, KT, AC), pp. 240–243.
CSMR-2010-KellensNSRD #co-evolution: Co-evolving Annotations and Source Code through Smart Annotations (AK, CN, KDS, CDR, TD), pp. 117–126.
CSMR-2010-MadaniGPGA #identifier #recognition #speech #using #word: Recognizing Words from Source Code Identifiers Using Speech Recognition Techniques (NM, LG, MDP, YGG, GA), pp. 68–77.
ICPC-2010-BacchelliDL: Extracting Source Code from E-Mails (AB, MD, ML), pp. 24–33.
ICSM-2010-KeivanlooRSR #code search #framework #named #scalability #semantics: SE-CodeSearch: A scalable Semantic Web-based source code search infrastructure (IK, LR, PS, JR), pp. 1–5.
ICSM-2010-RountevVYS #comprehension #dependence #java: Understanding parallelism-inhibiting dependences in sequential Java programs (AR, KVV, DY, PS), pp. 1–9.
ICSM-2010-SavageDGP #named #topic #using: TopicXP: Exploring topics in source code using Latent Dirichlet Allocation (TS, BD, MG, DP), pp. 1–6.
PASTE-2010-FlanaganF #concurrent #dynamic analysis #framework: The RoadRunner dynamic analysis framework for concurrent programs (CF, SNF), pp. 1–8.
SCAM-2010-GrantC #analysis #concept: Estimating the Optimal Number of Latent Concepts in Source Code Analysis (SG, JRC), pp. 65–74.
SCAM-2010-Harman #analysis #why: Why Source Code Analysis and Manipulation Will Always be Important (MH), pp. 7–19.
SCAM-2010-KetterlinC #behaviour #execution #memory management: Recovering the Memory Behavior of Executable Programs (AK, PC), pp. 189–198.
WCRE-2010-Arnaoudova #quality: Improving Source Code Quality through the Definition of Linguistic Antipatterns (VA), pp. 285–288.
WCRE-2010-DavisG #assembly #detection: From Whence It Came: Detecting Source Code Clones by Analyzing Assembler (IJD, MWG), pp. 242–246.
WCRE-2010-Eshkevari #identifier #refactoring: Linguistic Driven Refactoring of Source Code Identifiers (LME), pp. 297–300.
WCRE-2010-GomezDD #integration #visual notation: Visually Supporting Source Code Changes Integration: The Torch Dashboard (VUG, SD, TD), pp. 55–64.
WCRE-2010-Guerrouj #analysis #automation #concept #identifier: Automatic Derivation of Concepts Based on the Analysis of Source Code Identifiers (LG), pp. 301–304.
WCRE-2010-HaiducAMM #automation #on the #summary #using: On the Use of Automated Text Summarization Techniques for Summarizing Source Code (SH, JA, LM, AM), pp. 35–44.
WCRE-2010-KagdiGPC #concept #impact analysis: Blending Conceptual and Evolutionary Couplings to Support Change Impact Analysis in Source Code (HHK, MG, DP, MLC), pp. 119–128.
WCRE-2010-LawrieBM #normalisation: Normalizing Source Code Vocabulary (DJL, DB, CM), pp. 3–12.
WCRE-2010-LozanoKMA #mining: Mining Source Code for Structural Regularities (AL, AK, KM, GA), pp. 22–31.
WCRE-2010-MilanovaL #comprehension #concurrent #java #static analysis: Static Analysis for Understanding Shared Objects in Open Concurrent Java Programs (AM, YL), pp. 45–54.
IFM-2010-AutexierL #c #impact analysis #verification: Adding Change Impact Analysis to the Formal Verification of C Programs (SA, CL), pp. 59–73.
IFM-2010-Bostrom #modelling: Creating Sequential Programs from Event-B Models (PB), pp. 74–88.
IFM-2010-Dimovski #composition #equivalence #nondeterminism #termination: A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs (AD), pp. 121–135.
FLOPS-2010-Sagonas #concurrent #detection #erlang #fault #static analysis #using: Using Static Analysis to Detect Type Errors and Concurrency Defects in Erlang Programs (KFS), pp. 13–18.
CIG-2010-Greenwood #evolution #social: Evolving N-person social dilemma strategies to resolve questions on participation in climate change programs (GWG), pp. 227–234.
ICGT-2010-PoskittP #calculus #graph #hoare: A Hoare Calculus for Graph Programs (CMP, DP), pp. 139–154.
ICGT-2010-Radke #correctness #graph: Correctness of Graph Programs Relative to HR⁺ Conditions (HR), pp. 410–412.
ICGT-2010-Ujhelyi #model transformation #static typing #type checking: Static Type Checking of Model Transformation Programs (ZU), pp. 413–415.
SOFTVIS-2010-HumphreyDGT #named #visual notation: GEM: graphical explorer of MPI programs (AH, CD, GG, BRT), pp. 217–218.
SOFTVIS-2010-JohnsonM #concurrent #execution #named #visualisation: Beat: a tool for visualizing the execution of object orientated concurrent programs (PJ, SM), pp. 225–226.
ICML-2010-LiangJK #approach #learning: Learning Programs: A Hierarchical Bayesian Approach (PL, MIJ, DK), pp. 639–646.
ICML-2010-PetrikTPZ #approximate #feature model #linear #markov #process #using: Feature Selection Using Regularization in Approximate Linear Programs for Markov Decision Processes (MP, GT, RP, SZ), pp. 871–878.
KR-2010-GiacomoLP #calculus #game studies #reasoning #representation: Situation Calculus Based Programs for Representing and Reasoning about Game Structures (GDG, YL, ARP).
KR-2010-ZhangZ #bound #on the #semantics #set: On the Progression Semantics and Boundedness of Answer Set Programs (YZ, YZ).
ECOOP-2010-GilL #java #using: The Use of Overloading in Java Programs (JYG, KL), pp. 529–551.
OOPSLA-2010-AltmanAFM #analysis #performance: Performance analysis of idle programs (ERA, MA, SF, NM), pp. 739–753.
OOPSLA-2010-GabelYYGS #consistency #detection #nondeterminism #scalability: Scalable and systematic detection of buggy inconsistencies in source code (MG, JY, YY, MG, ZS), pp. 175–190.
OOPSLA-2010-KleinFF #higher-order #random testing #testing: Random testing for higher-order, stateful programs (CK, MF, RBF), pp. 555–566.
OOPSLA-2010-UpadhyayaMP #automation #identification #memory management: Automatic atomic region identification in shared memory SPMD programs (GU, SPM, VSP), pp. 652–670.
LOPSTR-2010-BacciC #first-order #functional #logic programming: Abstract Diagnosis of First Order Functional Logic Programs (GB, MC), pp. 215–233.
LOPSTR-2010-StroderSG #analysis #dependence #logic programming #termination: Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (TS, PSK, JG), pp. 184–199.
LOPSTR-2010-Vidal #approach #hybrid #logic programming #partial evaluation: A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs (GV), pp. 200–214.
LOPSTR-2010-VoetsS #analysis #logic programming #using: Non-termination Analysis of Logic Programs Using Types (DV, DDS), pp. 133–148.
PADL-2010-LiT #detection #erlang: Similar Code Detection and Elimination for Erlang Programs (HL, SJT), pp. 104–118.
PEPM-2010-BoustaniH #java: Corrective hints for type incorrect generic Java programs (NEB, JH), pp. 5–14.
PLDI-2010-RichardsLBV #analysis #behaviour #javascript: An analysis of the dynamic behavior of JavaScript programs (GR, SL, BB, JV), pp. 1–12.
POPL-2010-ChaudhuriGL #analysis: Continuity analysis of programs (SC, SG, RL), pp. 57–70.
POPL-2010-HarrisSIG #program analysis #satisfiability: Program analysis via satisfiability modulo path programs (WRH, SS, FI, AG), pp. 71–82.
POPL-2010-JostHLH #higher-order #resource management: Static determination of quantitative resource usage for higher-order programs (SJ, KH, HWL, MH), pp. 223–236.
POPL-2010-MagillTLT #abstraction #automation: Automatic numeric abstractions for heap-manipulating programs (SM, MHT, PL, YKT), pp. 211–222.
POPL-2010-MartinHCAC #c #c++ #concurrent #policy: Dynamically checking ownership policies in concurrent c/c++ programs (JPM, MH, MC, PA, MC), pp. 457–470.
POPL-2010-NanevskiVB #verification: Structuring the verification of heap-manipulating programs (AN, VV, JB), pp. 261–274.
QAPL-2010-NdukwuMc #abstraction #approach #independence #probability: An expectation transformer approach to predicate abstraction and data independence for probabilistic programs (UN, AM), pp. 129–143.
SAS-2010-AliasDFG #bound #complexity #multi #ranking #termination: Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs (CA, AD, PF, LG), pp. 117–133.
SAS-2010-DilligDA #constraints #online #scalability #static analysis: Small Formulas for Large Programs: On-Line Constraint Simplification in Scalable Static Analysis (ID, TD, AA), pp. 236–252.
SAS-2010-FarzanK #analysis #composition #concurrent: Compositional Bitvector Analysis for Concurrent Programs with Nested Locks (AF, ZK), pp. 253–270.
SAS-2010-KatoenMMM #automation #generative #invariant #probability: Linear-Invariant Generation for Probabilistic Programs: — Automated Support for Proof-Based Methods (JPK, AM, LM, CCM), pp. 390–406.
SAS-2010-VechevYRS #automation #parallel #verification: Automatic Verification of Determinism for Structured Parallel Programs (MTV, EY, RR, VS), pp. 455–471.
ASE-2010-Chen #documentation #traceability #visualisation: Extraction and visualization of traceability relationships between documents and source code (XC), pp. 505–510.
ASE-2010-GermanMI #automation #identification: A sentence-matching method for automatic license identification of source code files (DMG, YM, KI), pp. 437–446.
ASE-2010-QiRL #evolution #generative #testing: Test generation to expose changes in evolving programs (DQ, AR, ZL), pp. 397–406.
FSE-2010-GabelS #case study: A study of the uniqueness of source code (MG, ZS), pp. 147–156.
FSE-2010-HuangLZ #concurrent #java #lightweight #multi #named: LEAP: lightweight deterministic multi-processor replay of concurrent java programs (JH, PL, CZ), pp. 207–216.
FSE-2010-HuangLZ10a #concurrent #java #lightweight #multi #named: LEAP: lightweight deterministic multi-processor replay of concurrent java programs (JH, PL, CZ), pp. 385–386.
FSE-2010-JalbertS #concurrent #debugging #effectiveness: A trace simplification technique for effective debugging of concurrent programs (NJ, KS), pp. 57–66.
FSE-2010-LauterburgKMA #named #testing: Basset: a tool for systematic testing of actor programs (SL, RKK, DM, GA), pp. 363–364.
ICSE-2010-BacchelliLR: Linking e-mails and source code artifacts (AB, ML, RR), pp. 375–384.
ICSE-2010-BurnimS #named #parallel #specification #thread: DETERMIN: inferring likely deterministic specifications of multithreaded programs (JB, KS), pp. 415–424.
ICSE-2010-FerrariBLGFCLTSSRMBM #aspect-oriented #case study #evolution: An exploratory study of fault-proneness in evolving aspect-oriented programs (FCF, RB, OALL, AG, EF, NC, FL, NT, LS, SS, AR, PCM, TVB, JCM), pp. 65–74.
ICSE-2010-FritzOMM: A degree-of-knowledge model to capture source code familiarity (TF, JO, GCM, ERMH), pp. 385–394.
ICSE-2010-GenevesL #xquery: Eliminating dead-code from XQuery programs (PG, NL), pp. 305–306.
ICSE-2010-HaiducAM #comprehension #summary: Supporting program comprehension with source code summarization (SH, JA, AM), pp. 223–226.
ICSE-2010-LaiCC #detection #parallel #random #testing #thread: Detecting atomic-set serializability violations in multithreaded programs through active randomized testing (ZL, SCC, WKC), pp. 235–244.
ICSE-2010-NguyenNPAN #debugging #object-oriented: Recurring bug fixes in object-oriented programs (TTN, HAN, NHP, JMAK, TNN), pp. 315–324.
ICSE-2010-NitaN #adaptation #api #using: Using twinning to adapt programs to alternative APIs (MN, DN), pp. 205–214.
ICSE-2010-ParkVH #concurrent #fault #locality #named: Falcon: fault localization in concurrent programs (SP, RWV, MJH), pp. 245–254.
ICSE-2010-Rakamaric #concurrent #named: STORM: static unit checking of concurrent programs (ZR), pp. 519–520.
ICSE-2010-RungtaM #concurrent #debugging #slicing: Slicing and dicing bugs in concurrent programs (NR, EM), pp. 195–198.
SAC-2010-BallanceC #monitoring #performance: Monitoring MPI programs for performance characterization and management control (RAB, JC), pp. 2305–2310.
SAC-2010-GravinoTS #analysis #comprehension #empirical #modelling: An empirical investigation on the relation between analysis models and source code comprehension (CG, GT, GS), pp. 2365–2366.
SAC-2010-LesnerBBB #detection #exclamation #framework #novel #student: A novel framework to detect source code plagiarism: now, students have to work for real! (BL, RB, CB, GB), pp. 57–58.
SAC-2010-ZhouCS #consistency #linear: Reparameterization based consistent graph-structured linear programs (HZ, QC, ZS), pp. 974–978.
LDTA-2010-GiorgettiMTK #case study #java #specification: Specifying generic Java programs: two case studies (AG, CM, ET, OK), p. 8.
SLE-2010-KatsKV #ambiguity #interactive #metaprogramming #syntax: Interactive Disambiguation of Meta Programs with Concrete Object Syntax (LCLK, KTK, EV), pp. 327–336.
CC-2010-BaskaranRS #automation #code generation: Automatic C-to-CUDA Code Generation for Affine Programs (MMB, JR, PS), pp. 244–263.
CC-2010-CraikK #object-oriented #parallel #using: Using Ownership to Reason about Inherent Parallelism in Object-Oriented Programs (AC, WK), pp. 145–164.
CGO-2010-PatilPSLC #analysis #framework #named #parallel: PinPlay: a framework for deterministic replay and reproducible analysis of parallel programs (HP, CP, MS, GL, JC), pp. 2–11.
CGO-2010-StrattonGMAMHH #compilation #fine-grained #manycore #performance #thread: Efficient compilation of fine-grained SPMD-threaded programs for multicore CPUs (JAS, VG, JM, BA, MM, ZH, WmWH), pp. 111–119.
CGO-2010-WeiYYG #communication #pipes and filters: Minimizing communication in rate-optimal software pipelining for stream programs (HW, JY, HY, GRG), pp. 210–217.
DAC-2010-JuHRC #analysis #multi: Timing analysis of esterel programs on general-purpose multiprocessors (LJ, BKH, AR, SC), pp. 48–51.
DATE-2010-BaudischBS #independence #parallel #thread: Multithreaded code from synchronous programs: Extracting independent threads for OpenMP (DB, JB, KS), pp. 949–952.
DATE-2010-ChePC #compilation #manycore: Compilation of stream programs for multicore processors that incorporate scratchpad memories (WC, AP, KSC), pp. 1118–1123.
DATE-2010-WenCCL #debugging #named #parallel #runtime: RunAssert: A non-intrusive run-time assertion for parallel programs debugging (CNW, SHC, TFC, TJL), pp. 287–290.
OSDI-2010-PowerL #distributed #named #performance: Piccolo: Building Fast, Distributed Programs with Partitioned Tables (RP, JL), pp. 293–306.
PDP-2010-WangBBW #approach #modelling #parallel #search-based: Model Driven Iterative Multi-dimensional Parallelization of Multi-task Programs for the Cell BE: A Genetic Algorithm-Based Approach (MW, NB, FB, ZW), pp. 218–222.
PPoPP-2010-Chakrabarti #abstraction #analysis #effectiveness #performance: New abstractions for effective performance analysis of STM programs (DRC), pp. 333–334.
PPoPP-2010-LiGKQ #verification: A symbolic verifier for CUDA programs (GL, GG, RMK, DQ), pp. 357–358.
PPoPP-2010-Mendez-LojoNPSHKBP #optimisation: Structure-driven optimizations for amorphous data-parallel programs (MML, DN, DP, XS, MAH, MK, MB, KP), pp. 3–14.
PPoPP-2010-YangXKZ #compilation #optimisation: An optimizing compiler for GPGPU programs with input-data sharing (YY, PX, JK, HZ), pp. 343–344.
PPoPP-2010-ZhangJS #matter #parallel #performance #question #thread: Does cache sharing on modern CMP matter to the performance of contemporary multithreaded programs? (EZZ, YJ, XS), pp. 203–212.
PPoPP-2010-ZyulkyarovHUCV #debugging #memory management #transaction: Debugging programs that use atomic blocks and transactional memory (FZ, TH, OSÜ, AC, MV), pp. 57–66.
ESOP-2010-AmtoftHR #array #automation #certification #contract #data flow #precise #reasoning #verification: Precise and Automated Contract-Based Reasoning for Verification and Certification of Information Flow Properties of Programs with Arrays (TA, JH, ER), pp. 43–63.
ESOP-2010-MatsudaMHT #approach #grammarware: A Grammar-Based Approach to Invertible Programs (KM, SCM, ZH, MT), pp. 448–467.
ESOP-2010-MeolaW #fault tolerance #logic #reasoning: Faulty Logic: Reasoning about Fault Tolerant Programs (MLM, DW), pp. 468–487.
FASE-2010-ChatterjeeARS #concurrent #multi #thread: Analyzing the Impact of Change in Multi-threaded Programs (KC, LdA, VR, CS), pp. 293–307.
TACAS-2010-Aderhold #analysis #automation #higher-order #recursion #termination: Automated Termination Analysis for Programs with Second-Order Recursion (MA), pp. 221–235.
CAV-2010-BouajjaniDERS #bound #invariant #synthesis: Invariant Synthesis for Programs Manipulating Lists with Unbounded Data (AB, CD, CE, AR, MS), pp. 72–88.
CAV-2010-CohenMST #concurrent #invariant #verification: Local Verification of Global Invariants in Concurrent Programs (EC, MM, WS, ST), pp. 480–494.
CAV-2010-KahlonW #concurrent #debugging #detection #graph #precise: Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs (VK, CW), pp. 434–449.
CAV-2010-KaiserKW #concurrent #detection: Dynamic Cutoff Detection in Parameterized Concurrent Programs (AK, DK, TW), pp. 645–659.
CAV-2010-TorreMP #concurrent #interface #linear #model checking #using: Model-Checking Parameterized Concurrent Programs Using Linear Interfaces (SLT, PM, GP), pp. 629–644.
ICLP-2010-Alviano10 #datalog #set: Dynamic Magic Sets for Disjunctive Datalog Programs (MA), pp. 226–235.
ICLP-2010-BasolEFI10: HEX Programs with Action Atoms (SB, OE, MF, GI), pp. 24–33.
ICLP-2010-BautersJSVC10 #communication #set: Communicating Answer Set Programs (KB, JJ, SS, DV, MDC), pp. 34–43.
ICLP-2010-Dandois10 #logic programming #program analysis: Program analysis for code duplication in logic programs (CD), pp. 241–247.
ICLP-2010-FayruzovJVCC10 #performance #set: Efficient Solving of Time-dependent Answer Set Programs (TF, JJ, DV, CC, MDC), pp. 64–73.
ICLP-2010-Janhunen10 #constraints #revisited #semantics: Sampler Programs: The Stable Model Semantics of Abstract Constraint Programs Revisited (TJ), pp. 94–103.
ICLP-2010-Near10 #logic programming #relational #specification: From Relational Specifications to Logic Programs (JPN), pp. 144–153.
ICLP-2010-OetschPT10: Methods and Methodologies for Developing Answer-Set Programs — Project Description (JO, JP, HT), pp. 154–161.
ICLP-2010-PereiraP10 #logic programming #semantics: Tight Semantics for Logic Programs (LMP, AMP), pp. 134–143.
ICLP-2010-RiguzziS10 #logic programming #reasoning: Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions (FR, TS), pp. 162–171.
ICLP-2010-ShakarianSS10 #network #optimisation #problem #social #using: Using Generalized Annotated Programs to Solve Social Network Optimization Problems (PS, VSS, MLS), pp. 182–191.
ICLP-2010-SimariS10 #abduction #logic programming #probability: Abductive Inference in Probabilistic Logic Programs (GIS, VSS), pp. 192–201.
ICLP-J-2010-BaseliceB #decidability #subclass: A decidable subclass of finitary programs (SB, PAB), pp. 481–496.
ICLP-J-2010-Delgrande #approach #logic programming #semantics #set: A program-level approach to revising logic programs under the answer set semantics (JPD), pp. 565–580.
ICLP-J-2010-OetschPST #detection: The system Kato: Detecting cases of plagiarism for answer-set programs (JO, JP, MS, HT), pp. 759–775.
ICLP-J-2010-OetschPT #debugging: Catching the Ouroboros: On debugging non-ground answer-set programs (JO, JP, HT), pp. 513–529.
ICLP-J-2010-PettorossiSP #infinity #logic programming: Transformations of logic programs on infinite lists (AP, VS, MP), pp. 383–399.
ICLP-J-2010-Schneider-KampGSST #analysis #automation #logic programming #termination: Automated termination analysis for logic programs with cut (PSK, JG, TS, AS, RT), pp. 365–381.
ICLP-J-2010-WangYYS #logic programming: Loop formulas for description logic programs (YW, JHY, LYY, YDS), pp. 531–545.
ICST-2010-DebroyW #automation #using: Using Mutation to Automatically Suggest Fixes for Faulty Programs (VD, WEW), pp. 65–74.
ICTSS-2010-Gladisch #first-order #generative #logic #quantifier #specification #testing: Test Data Generation for Programs with Quantified First-Order Logic Specifications (CG), pp. 158–173.
IJCAR-2010-Aderhold #automation #axiom #higher-order #induction #recursion #synthesis: Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion (MA), pp. 263–277.
IJCAR-2010-AyadM #float #multi #verification: Multi-Prover Verification of Floating-Point Programs (AA, CM), pp. 127–141.
ISSTA-2010-WeiPFSBMZ #automation #contract: Automated fixing of programs with contracts (YW, YP, CAF, LSS, SB, BM, AZ), pp. 61–72.
SAT-2010-FuhsS #linear #satisfiability #using: Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT (CF, PSK), pp. 71–84.
VMCAI-2010-AlurC #reasoning: Temporal Reasoning for Procedural Programs (RA, SC), pp. 45–60.
VMCAI-2010-Leino #concurrent #verification: Verifying Concurrent Programs with Chalice (KRML), p. 2.
ECDL-2009-AlmeidaATC #quality #visualisation: A Visualization Technique for Quality Control of Massive Digitization Programs (RAdA, PA, AT, PC), pp. 150–155.
SIGMOD-2009-ChaiVDN #feedback #information management #integration: Efficiently incorporating user feedback into information extraction and integration programs (XC, BQV, AD, JFN), pp. 87–100.
SIGMOD-2009-ChenGDYR #evolution #optimisation: Optimizing complex extraction programs over evolving text data (FC, BJG, AD, JY, RR), pp. 321–334.
SIGMOD-2009-OlstonCS #data flow #generative: Generating example data for dataflow programs (CO, SC, US), pp. 245–256.
CSEET-2009-TaranRMB #collaboration #design #feedback #implementation #process: A Training Process for Faculty Members in Collaborative Degree Programs: Design, Implementation and Feedback (GT, MZR, PM, PB), pp. 122–129.
ITiCSE-2009-EnglishR #assessment #automation #case study #student #using: Evaluating students’ programs using automated assessment: a case study (JE, TR), p. 371.
ITiCSE-2009-Impagliazzo #metric #performance: Graduate attributes and performance measures: refinements in assessing programs (JI), p. 370.
SIGITE-2009-Hartpence #case study #experience #network #security: Qos content and experiences for IT, networking and security programs (BH), pp. 60–64.
SIGITE-2009-Hislop: Sharing instructional materials for IT degree programs (GWH), p. 207.
SIGITE-2009-HomkesS #evaluation: Meeting the ABET program outcome for issues and responsibilities: an evaluation of CS, IS, and IT programs (RH, RAS), pp. 133–137.
CSMR-2009-AbebeHMTA #evolution: Analyzing the Evolution of the Source Code Vocabulary (SLA, SH, AM, PT, GA), pp. 189–198.
CSMR-2009-Ghazarian #case study #evolution: A Case Study of Source Code Evolution (AG), pp. 159–168.
ICPC-2009-AuprasertL #representation: Representing source code with Granular hierarchical structures (BA, YL), pp. 319–320.
ICPC-2009-CeccatoPNFRTT #assessment #effectiveness #obfuscation: The effectiveness of source code obfuscation: An experimental assessment (MC, MDP, JN, PF, FR, MT, PT), pp. 178–187.
ICPC-2009-ChilowiczDR #detection #similarity #syntax: Syntax tree fingerprinting for source code similarity detection (MC, ÉD, GR), pp. 243–247.
ICPC-2009-HanWYCZL #clustering #comprehension #design pattern #open source: Design pattern directed clustering for understanding open source code (ZH, LW, LY, XC, JZ, XL), pp. 295–296.
ICPC-2009-HuangDS #policy #prototype: Prototyping synchronization policies for existing programs (YH, LKD, REKS), pp. 289–290.
ICPC-2009-NilssonLHN #fact extraction #natural language #parsing: Natural language parsing for fact extraction from source code (JN, WL, JH, JN), pp. 223–227.
ICPC-2009-SchauerK #concept: A case for concept programs (RS, RKK), pp. 258–262.
ICSM-2009-Adams #co-evolution: Co-evolution of source code and the build system (BA), pp. 461–464.
ICSM-2009-HolmesCWD #case study #using: The end-to-end use of source code examples: An exploratory study (RH, RC, RJW, JD), pp. 555–558.
ICSM-2009-Wang #developer #motivation #what: What motivate software engineers to refactor source code? evidences from professional developers (YW), pp. 413–416.
ICSM-2009-YoshikawaHS #natural language #ontology #traceability #using: Recovering traceability links between a simple natural language sentence and source code using domain ontologies (TY, SH, MS), pp. 551–554.
MSR-2009-EnslenHPV #analysis #automation #identifier #mining: Mining source code to automatically split identifiers for software analysis (EE, EH, LLP, KVS), pp. 71–80.
MSR-2009-Kuhn #automation #component #evolution #using #word: Automatic labeling of software components and their evolution using log-likelihood ratio of word frequencies in source code (AK), pp. 175–178.
MSR-2009-Mockus #scalability #towards #version control: Amassing and indexing a large sample of version control systems: Towards the census of public source code history (AM), pp. 11–20.
SCAM-2009-CanetCM #analysis #c: A Value Analysis for C Programs (GC, PC, BM), pp. 123–124.
SCAM-2009-Giffhorn #concurrent: Chopping Concurrent Programs (DG), pp. 13–22.
SCAM-2009-KlintSV #analysis #domain-specific language #named #rascal: RASCAL: A Domain Specific Language for Source Code Analysis and Manipulation (PK, TvdS, JJV), pp. 168–177.
WCRE-1999-AnquetilRAAHPPP99a #architecture #java #named: JavaCompExt: Extracting Architectural Elements from Java Source Code (NA, JCR, PA, GA, PH, TP, DP, VP), pp. 317–318.
WCRE-1999-BacchelliDLR99a #benchmark #lightweight #metric: Benchmarking Lightweight Techniques to Link E-Mails and Source Code (AB, MD, ML, RR), pp. 205–214.
WCRE-1999-PentaG99a #how #question: Who are Source Code Contributors and How do they Change? (MDP, DMG), pp. 11–20.
WCRE-1999-Perez-CastilloGAP99a #legacy #on the #using: On the Use of ADM to Contextualize Data on Legacy Source Code for Software Modernization (RPC, IGRdG, OAG, MP), pp. 128–132.
WCRE-1999-RatiuMJ99a #composition #logic: The Logical Modularity of Programs (DR, RM, JJ), pp. 123–127.
CIAA-2009-AtigT #communication #parallel #verification: Verifying Parallel Programs with Dynamic Communication Structures (MFA, TT), pp. 145–154.
FM-2009-LuthW #c #specification #verification: Certifiable Specification and Verification of C Programs (CL, DW), pp. 419–434.
FM-2009-WangKGG #analysis #concurrent #predict: Symbolic Predictive Analysis for Concurrent Programs (CW, SK, MKG, AG), pp. 256–272.
SEFM-2009-BonfanteMR #self: A Computability Perspective on Self-Modifying Programs (GB, JYM, DRP), pp. 231–239.
SEFM-2009-ColomboPS #java #monitoring #realtime: LARVA --- Safer Monitoring of Real-Time Java Programs (CC, GJP, GS), pp. 33–37.
SEFM-2009-Ferrara #java #named #parallel #thread: Checkmate: A Generic Static Analyzer of Java Multithreaded Programs (PF), pp. 169–178.
SEFM-2009-Jeannet #concurrent #interprocedural #relational #verification: Relational Interprocedural Verification of Concurrent Programs (BJ), pp. 83–92.
CEFP-2009-TothBHLTK #behaviour #dependence #erlang #graph #impact analysis #using: Impact Analysis of Erlang Programs Using Behaviour Dependency Graphs (MT, IB, ZH, LL, MT, TK), pp. 372–390.
ICFP-2009-ChlipalaMMSW #effectiveness #higher-order #imperative #interactive #proving: Effective interactive proofs for higher-order imperative programs (AC, JGM, GM, AS, RW), pp. 79–90.
CHI-2009-JakobsenH #using #visualisation: Fisheyes in the field: using method triangulation to study the adoption and use of a source code visualization (MRJ, KH), pp. 1579–1588.
VISSOFT-2009-CottrellGHWD #visual notation: Compare and contrast: Visual exploration of source code examples (RC, BG, RH, RJW, JD), pp. 29–32.
VISSOFT-2009-OliveiraPHC #behaviour #domain-specific language #visualisation: Visualization of domain-specific programs’ behavior (NO, MJVP, PRH, DCdC), pp. 37–40.
ECIR-2009-Kettunen #metric #question: Choosing the Best MT Programs for CLIR Purposes — Can MT Metrics Be Helpful? (KK), pp. 706–712.
ICML-2009-PetrikZ #approximate #constraints #linear: Constraint relaxation in approximate linear programs (MP, SZ), pp. 809–816.
ECOOP-2009-SteimannT #java #refactoring: From Public to Private to Absent: Refactoring Java Programs under Constrained Accessibility (FS, AT), pp. 419–443.
OOPSLA-2009-DincklageD #optimisation #semantics: Optimizing programs with intended semantics (DvD, AD), pp. 409–424.
OOPSLA-2009-TsafrirWBS #dependence #performance: Minimizing dependencies within generic classes for faster and smaller programs (DT, RWW, DFB, BS), pp. 425–444.
LOPSTR-2009-Schneider-KampGN #dependence #framework #logic programming #termination: The Dependency Triple Framework for Termination of Logic Programs (PSK, JG, MTN), pp. 37–51.
LOPSTR-2009-Vidal #declarative #partial evaluation #scalability #towards: Towards Scalable Partial Evaluation of Declarative Programs (GV), pp. 1–4.
PADL-2009-DukeBWR #design #domain-specific language #embedded #multi #visualisation: Huge Data But Small Programs: Visualization Design via Multiple Embedded DSLs (DJD, RB, MW, CR), pp. 31–45.
PADL-2009-PereiraP #logic programming #modelling #query #top-down: Layered Models Top-Down Querying of Normal Logic Programs (LMP, AMP), pp. 254–268.
PEPM-2009-PardoFS #higher-order #monad: Shortcut fusion rules for the derivation of circular and higher-order monadic programs (AP, JPF, JS), pp. 81–90.
PEPM-2009-RungtaM #model checking #morphism #polymorphism: Guided model checking for programs with polymorphism (NR, EGM), pp. 21–30.
PLDI-2009-NeamtiuH #concurrent #multi #thread: Safe and timely updates to multi-threaded programs (IN, MWH), pp. 13–24.
PLDI-2009-PetrankMS #bound #parallel: Progress guarantee for parallel programs via bounded lock-freedom (EP, MM, BS), pp. 144–154.
PLDI-2009-TorreMP #calculus #fixpoint #recursion #using: Analyzing recursive programs using a fixed-point calculus (SLT, PM, GP), pp. 211–222.
PLDI-2009-ZeeKR #imperative #proving: An integrated proof language for imperative programs (KZ, VK, MCR), pp. 338–351.
POPL-2009-GantyMR #liveness #verification: Verifying liveness for asynchronous programs (PG, RM, AR), pp. 102–113.
POPL-2009-Kobayashi #higher-order #recursion #verification: Types and higher-order recursion schemes for verification of higher-order programs (NK), pp. 416–428.
PPDP-2009-FalaschiOP #abstract interpretation #concurrent #constraints #framework: A framework for abstract interpretation of timed concurrent constraint programs (MF, CO, CP), pp. 207–218.
PPDP-2009-PhanJ #analysis: Path-sensitive region analysis for mercury programs (QP, GJ), pp. 161–170.
PPDP-2009-SagonasA #automation #erlang #refactoring: Automatic refactoring of Erlang programs (KFS, TA), pp. 13–24.
PPDP-2009-Virseda #algorithm #debugging #declarative #framework #higher-order #logic #verification: A higher-order logical framework for the algorithmic debugging and verification of declarative programs (RdVV), pp. 49–60.
SAS-2009-Bodik #algorithm #synthesis: Algorithmic Program Synthesis with Partial Programs and Decision Procedures (RB), p. 1.
SAS-2009-GodoyT #invariant: Invariant Checking for Programs with Procedure Calls (GG, AT), pp. 326–342.
SAS-2009-Hurlin #automation #optimisation #parallel #proving: Automatic Parallelization and Optimization of Programs by Proof Rewriting (CH), pp. 52–68.
RE-2009-OmoronyiaSRFW #case study #developer #navigation #traceability: Use Case to Source Code Traceability: The Developer Navigation View Point (IO, GS, MR, JDF, MW), pp. 237–242.
ASE-2009-KroeningSTTW #named: Loopfrog: A Static Analyzer for ANSI-C Programs (DK, NS, ST, AT, CMW), pp. 668–670.
ASE-2009-LauterburgDMA #framework: A Framework for State-Space Exploration of Java-Based Actor Programs (SL, MD, DM, GAA), pp. 468–479.
ASE-2009-LinTCZ #adaptation #approach #java #random testing #testing: A Divergence-Oriented Approach to Adaptive Random Testing of Java Programs (YL, XT, YC, JZ), pp. 221–232.
ASE-2009-LiXTHS #automation #generative #named #regular expression #testing #using: Reggae: Automated Test Generation for Programs Using Complex Regular Expressions (NL, TX, NT, JdH, WS), pp. 515–519.
ASE-2009-YuAB #analysis #generative #string #using: Generating Vulnerability Signatures for String Manipulating Programs Using Automata-Based Forward and Backward Symbolic Analyses (FY, MA, TB), pp. 605–609.
ESEC-FSE-2009-BurnimS #parallel #thread: Asserting and checking determinism for multithreaded programs (JB, KS), pp. 3–12.
ESEC-FSE-2009-KahlonSKZ #concurrent #detection: Static data race detection for concurrent programs with asynchronous calls (VK, NS, EK, YZ), pp. 13–22.
ESEC-FSE-2009-QiRLV #approach #debugging #evolution #named: Darwin: an approach for debugging evolving programs (DQ, AR, ZL, KV), pp. 33–42.
ESEC-FSE-2009-ShermanDE #concurrent #testing: Saturation-based testing of concurrent programs (ES, MBD, SGE), pp. 53–62.
ESEC-FSE-2009-ThummalapentaXTHS #generative #mining #named #object-oriented #testing: MSeqGen: object-oriented unit-test generation via mining source code (ST, TX, NT, JdH, WS), pp. 193–202.
ICSE-2009-HangalL #automation #object-oriented: Automatic dimension inference and checking for object-oriented programs (SH, MSL), pp. 155–165.
ICSE-2009-HillPV #automation #maintenance #reuse: Automatically capturing source code context of NL-queries for software maintenance and reuse (EH, LLP, KVS), pp. 232–242.
SAC-2009-ZhaoZL #abstraction #multi #object-oriented: Abstraction of multiple executions of object-oriented programs (CZ, KZ, YL), pp. 549–550.
LDTA-2008-ChilowiczDR09: Finding Similarities in Source Code Through Factorization (MC, ÉD, GR), pp. 47–62.
LDTA-2008-FokkerS09 #abstract interpretation #attribute grammar #functional #using: Abstract Interpretation of Functional Programs using an Attribute Grammar System (JF, SDS), pp. 117–133.
LDTA-2008-LammelTK09 #fault #programming #traversal: Programming Errors in Traversal Programs Over Structured Data (RL, SJT, MK), pp. 135–153.
LDTA-2008-Nilsson-NymanHME09 #analysis #declarative #java: Declarative Intraprocedural Flow Analysis of Java Source Code (ENN, GH, EM, TE), pp. 155–171.
GPCE-2009-NedunuriC #performance #problem #synthesis: Synthesis of fast programs for maximum segment sum problems (SN, WRC), pp. 117–126.
ASPLOS-2009-RajamaniRRV #named: ISOLATOR: dynamically ensuring isolation in comcurrent programs (SKR, GR, VPR, KV), pp. 181–192.
CASE-2009-WangLNRKML #concurrent #parallel #thread: Maximally permissive deadlock avoidance for multithreaded computer programs (YW, HL, AN, SAR, TK, SAM, SL), pp. 37–41.
CC-2009-BraunH: Register Spilling and Live-Range Splitting for SSA-Form Programs (MB, SH), pp. 174–189.
CC-2009-GaoLXN #concurrent #predict #recursion #thread: Exploiting Speculative TLP in Recursive Programs by Dynamic Thread Prediction (LG, LL, JX, TFN), pp. 78–93.
CC-2009-Sarkar #challenge #optimisation #parallel: Challenges in Code Optimization of Parallel Programs (VS), p. 1.
CC-2009-VasudevanTDE #analysis #concurrent: Compile-Time Analysis and Specialization of Clocks in Concurrent Programs (NV, OT, JD, SAE), pp. 48–62.
CGO-2009-DuanFWZY #c #c++ #concurrent #consistency #detection: Detecting and Eliminating Potential Violations of Sequential Consistency for Concurrent C/C++ Programs (YD, XF, LW, CZ, PCY), pp. 25–34.
CGO-2009-LiuR #c++ #named #performance: Perflint: A Context Sensitive Performance Advisor for C++ Programs (LL, SR), pp. 265–274.
CGO-2009-UdupaGT #execution #pipes and filters: Software Pipelined Execution of Stream Programs on GPUs (AU, RG, MJT), pp. 200–209.
DAC-2009-DangRMM #generative #interactive #pipes and filters: Generating test programs to cover pipeline interactions (TND, AR, TM, PM), pp. 142–147.
DAC-2009-JuHCR #analysis: Context-sensitive timing analysis of Esterel programs (LJ, BKH, SC, AR), pp. 870–873.
ISMM-2009-NagarajanJG #self: Self-recovery in server programs (VN, DJ, RG), pp. 49–58.
ISMM-2009-UnnikrishnanS #analysis #functional #parametricity: Parametric heap usage analysis for functional programs (LU, SDS), pp. 139–148.
LCTES-2009-UdupaGT #execution #multi: Synergistic execution of stream programs on multicores with accelerators (AU, RG, MJT), pp. 99–108.
PPoPP-2009-BikshandiCKNPSSVW #implementation #multi #performance: Efficient, portable implementation of asynchronous multi-place programs (GB, JGC, SBK, VKN, IP, VAS, SS, PV, TW), pp. 271–282.
PPoPP-2009-HuangEHC #compilation #optimisation: Exploiting global optimizations for openmp programs in the openuh compiler (LH, DE, MWH, BMC), pp. 289–290.
PPoPP-2009-KejariwalC #analysis #concurrent #parallel #thread: Parallelization spectroscopy: analysis of thread-level parallelism in hpc programs (AK, CC), pp. 293–294.
PPoPP-2009-VoVDGKT #verification: Formal verification of practical MPI programs (AV, SSV, MD, GG, RMK, RT), pp. 261–270.
WRLA-2008-LucasM09 #equation #order #termination: Operational Termination of Membership Equational Programs: the Order-Sorted Way (SL, JM), pp. 207–225.
ESOP-2009-LeinoM #concurrent #multi #thread #verification: A Basis for Verifying Multi-threaded Programs (KRML, PM), pp. 378–393.
ESOP-2009-SadowskiFF #named #parallel #thread: SingleTrack: A Dynamic Determinism Checker for Multithreaded Programs (CS, SNF, CF), pp. 394–409.
ESOP-2009-WadlerF: Well-Typed Programs Can’t Be Blamed (PW, RBF), pp. 1–16.
FASE-2009-AcharyaX #api #mining #specification: Mining API Error-Handling Specifications from Source Code (MA, TX), pp. 370–384.
FASE-2009-ChocklerFGN #concurrent: Cross-Entropy-Based Replay of Concurrent Programs (HC, EF, BG, SN), pp. 201–215.
FASE-2009-KovacsV #array #invariant #proving #theorem proving #using: Finding Loop Invariants for Programs over Arrays Using a Theorem Prover (LK, AV), pp. 470–485.
FoSSaCS-2009-BolligGH #concurrent #recursion: Realizability of Concurrent Recursive Programs (BB, MLG, PH), pp. 410–424.
STOC-2009-Goldwasser #question: Athena lecture: Controlling Access to Programs? (SG), pp. 167–168.
TACAS-2009-AtigBQ #analysis #bound #concurrent #thread: Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads (MFA, AB, SQ), pp. 107–123.
TACAS-2009-BjornerTV #analysis #string: Path Feasibility Analysis for String-Manipulating Programs (NB, NT, AV), pp. 307–321.
TACAS-2009-BrughNR #dot-net #named #verification: MoonWalker: Verification of .NET Programs (NHMAdB, VYN, TCR), pp. 170–173.
TACAS-2009-KahlonSG #concurrent #reduction #semantics #thread: Semantic Reduction of Thread Interleavings in Concurrent Programs (VK, SS, AG), pp. 124–138.
TACAS-2009-VanoverbergheTP #generative #pointer: Test Input Generation for Programs with Pointers (DV, NT, FP), pp. 277–291.
CADE-2009-FalkeK #analysis #approach #automation #imperative #term rewriting #termination: A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs (SF, DK), pp. 277–293.
CAV-2009-BouissouGPTV #named: HybridFluctuat: A Static Analyzer of Numerical Programs within a Continuous Environment (OB, EG, SP, KT, FV), pp. 620–626.
CAV-2009-BozgaHIKV #array #automation #integer #verification: Automatic Verification of Integer Array Programs (MB, PH, RI, FK, TV), pp. 157–172.
CAV-2009-JoshiNPS #concurrent #framework #named #testing: CalFuzzer: An Extensible Active Testing Framework for Concurrent Programs (PJ, MN, CSP, KS), pp. 675–681.
CAV-2009-Strichman #equivalence #proving #verification: Regression Verification: Proving the Equivalence of Similar Programs (OS), p. 63.
CAV-2009-VerdoolaegeJB #equivalence #using: Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences (SV, GJ, MB), pp. 599–613.
CSL-2009-AlurCW #algorithm #analysis: Algorithmic Analysis of Array-Accessing Programs (RA, PC, SW), pp. 86–101.
ICLP-2009-BroechelerSS #logic programming #probability #query #using: Using Histograms to Better Answer Queries to Probabilistic Logic Programs (MB, GIS, VSS), pp. 40–54.
ICLP-2009-ChenJL #logic programming: Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs (XC, JJ, FL), pp. 130–144.
ICLP-2009-CostaRR #logic programming: A Term-Based Global Trie for Tabled Logic Programs (JC, JR, RR), pp. 205–219.
ICLP-2009-DelgrandeSTW #logic programming #semantics #set: Merging Logic Programs under Answer Set Semantics (JPD, TS, HT, SW), pp. 160–174.
ICLP-2009-Fodor #evaluation #logic programming #research #summary #transaction: Research Summary: Tabled Evaluation for Transaction Logic Programs (PF), pp. 525–526.
ICLP-2009-HolldoblerR #logic programming #semantics: Logic Programs under Three-Valued Lukasiewicz Semantics (SH, CDPKR), pp. 464–478.
ICLP-2009-LierlerL #decidability: One More Decidable Class of Finitely Ground Programs (YL, VL), pp. 489–493.
ICLP-2009-Namasivayam #logic programming #random: Study of Random Logic Programs (GN), pp. 555–556.
ICLP-2009-Truszczynski #logic programming #satisfiability #semantics: Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs (MT), pp. 175–189.
ICLP-2009-Voets #analysis #logic programming #research #summary: Research Summary: Non-termination Analysis of Logic Programs (DV), pp. 553–554.
ICLP-2009-VoetsS #analysis #approach #logic programming: A New Approach to Non-termination Analysis of Logic Programs (DV, DDS), pp. 220–234.
ICST-2009-Gotlieb #c #constraints #framework #named #testing: Euclide: A Constraint-Based Testing Framework for Critical C Programs (AG), pp. 151–160.
ICST-2009-KorelZT #validation: Assertion-Based Validation of Modified Programs (BK, QZ, LT), pp. 426–435.
ISSTA-2009-GorgZ #aspectj #difference #identification #semantics: Identifying semantic differences in AspectJ programs (MTG, JZ), pp. 25–36.
ISSTA-2009-MurphySK #automation #testing: Automatic system testing of programs without test oracles (CM, KS, GEK), pp. 189–200.
ISSTA-2009-SaxenaPMS #execution #symbolic computation: Loop-extended symbolic execution on binary programs (PS, PP, SM, DS), pp. 225–236.
LICS-2009-HofmannS #pointer #reachability: Pointer Programs and Undirected Reachability (MH, US), pp. 133–142.
TestCom-FATES-2009-GuoDW #erlang #testing: Applying Testability Transformations to Achieve Structural Coverage of Erlang Programs (QG, JD, NW), pp. 81–96.
VMCAI-2009-BentonF #behaviour #java: Mostly-Functional Behavior in Java Programs (WCB, CNF), pp. 29–43.
VMCAI-2009-Gupta #concurrent #model checking: Model Checking Concurrent Programs (AG), p. 2.
VMCAI-2009-GurovH #behaviour: Reducing Behavioural to Structural Properties of Programs with Procedures (DG, MH), pp. 136–150.
CSEET-2008-PysterTHLBB #re-engineering: The Current State of Software Engineering Masters Degree Programs (ABP, RT, DH, KL, LB, KB), pp. 103–109.
ITiCSE-2008-BorstlerCBNWMC #object-oriented: Evaluating OO example programs for CS1 (JB, HBC, JB, MN, LKW, JEM, MEC), pp. 47–52.
ITiCSE-2008-Burrell #learning #object-oriented #process #programming #visualisation: Learning object oriented programming: unique visualizations of individuals learning styles, activities and the programs produced (CJB), p. 339.
ITiCSE-2008-JiWC #contest #detection #experience #programming: An experience of detecting plagiarized source codes in competitive programming contests (JHJ, GW, HGC), p. 369.
CSMR-2008-KanellopoulosTHV #clustering #maintenance: Interpretation of Source Code Clusters in Terms of the ISO/IEC-9126 Maintainability Characteristics (YK, CT, IH, JV), pp. 63–72.
CSMR-2008-PantosBGG #adaptation #assessment #case study #experience #quality: Experiences in Adapting a Source Code-Based Quality Assessment Technology (JP, ÁB, PG, TG), pp. 311–313.
ICPC-2008-EaddyAAG #dynamic analysis #information retrieval #named #program analysis #requirements #using: CERBERUS: Tracing Requirements to Source Code Using Information Retrieval, Dynamic Analysis, and Program Analysis (ME, AVA, GA, YGG), pp. 53–62.
ICPC-2008-HaiducM #on the #using: On the Use of Domain Terms in Source Code (SH, AM), pp. 113–122.
ICPC-2008-PinzgerGKG #comprehension #dependence #visual notation: A Tool for Visual Understanding of Source Code Dependencies (MP, KG, PK, HCG), pp. 254–259.
ICPC-2008-SatoST #comprehension #execution #user interface #visualisation: Support for Understanding GUI Programs by Visualizing Execution Traces Synchronized with Screen Transitions (TS, BS, JT), pp. 272–275.
ICSM-2008-AnvikS #issue tracking #maintenance: Task articulation in software maintenance: Integrating source code annotations with an issue tracking system (JA, MADS), pp. 460–461.
ICSM-2008-KagdiHM #question: Who can help me with this source code change? (HHK, MH, JIM), pp. 157–166.
ICSM-2008-Lozano: A methodology to assess the impact of source code flaws in changeability, and its application to clones (AL), pp. 424–427.
ICSM-2008-TallamTG #concurrent #detection #parallel #slicing #thread: Dynamic slicing of multithreaded programs for race detection (ST, CT, RG), pp. 97–106.
ICSM-2008-ZhangGLZ #aspectj #impact analysis: Change impact analysis for AspectJ programs (SZ, ZG, YL, JZ), pp. 87–96.
ICSM-2008-Zhao #aspect-oriented #challenge #maintenance: Maintenance support for aspect-oriented programs: opportinuties and challenges (JZ), pp. 482–483.
MSR-2008-ChangM #detection #evaluation: Evaluation of source code copy detection methods on freebsd (HFC, AM), pp. 61–66.
MSR-2008-HillFBSNPV #automation #maintenance #mining #named #tool support: AMAP: automatically mining abbreviation expansions in programs to enhance software maintenance tools (EH, ZPF, HB, GS, YN, LLP, KVS), pp. 79–88.
MSR-2008-OmoriM #development #editing: A change-aware development environment by recording editing operations of source code (TO, KM), pp. 31–34.
SCAM-2008-GiffhornH #analysis #java #precise #using: Precise Analysis of Java Programs Using JOANA (DG, CH), pp. 267–268.
SCAM-2008-PentaCA #detection #evolution: The Evolution and Decay of Statically Detected Source Code Vulnerabilities (MDP, LC, LA), pp. 101–110.
WCRE-2008-DolgovaC #automation #c #re-engineering: Automatic Type Reconstruction in Disassembled C Programs (KD, AC), pp. 202–206.
WCRE-2008-GasparisNEK #design #navigation #object-oriented: Navigating Through the Design of Object-Oriented Programs (EG, JN, AHE, RK), pp. 331–332.
WCRE-2008-GhanbariCA #analysis #aspectj #hybrid #java #query: A Hybrid Query Engine for the Structural Analysis of Java and AspectJ Programs (HG, CC, VA), pp. 133–137.
WCRE-2008-IshioDMI #detection #java #mining: Mining Coding Patterns to Detect Crosscutting Concerns in Java Programs (TI, HD, TM, KI), pp. 123–132.
WCRE-2008-LukinsKE #debugging #locality #retrieval #using: Source Code Retrieval for Bug Localization Using Latent Dirichlet Allocation (SKL, NAK, LHE), pp. 155–164.
WCRE-2008-Zhang: Exploring Regularity in Source Code: Software Science and Zipf’s Law (HZ), pp. 101–110.
ICALP-A-2008-AzarG #framework #integer #unification: Truthful Unification Framework for Packing Integer Programs with Choices (YA, IG), pp. 833–844.
SEFM-2008-Ferrara #parallel #static analysis #thread: Static Analysis of the Determinism of Multithreaded Programs (PF), pp. 41–50.
SEFM-2008-XavierHM #fault tolerance #using #verification: Using Formal Verification to Reduce Test Space of Fault-Tolerant Programs (KSX, SH, ACVdM), pp. 181–190.
ICFP-2008-FischerK #data flow #declarative #testing: Data-flow testing of declarative programs (SF, HK), pp. 201–212.
ICFP-2008-Ley-WildFA #compilation #continuation #self: Compiling self-adjusting programs with continuations (RLW, MF, UAA), pp. 321–334.
ICFP-2008-NanevskiMSGB #dependent type #imperative #named: Ynot: dependent types for imperative programs (AN, GM, AS, PG, LB), pp. 229–240.
ICFP-2008-SpoonhowerBHG #functional #parallel #profiling: Space profiling for parallel functional programs (DS, GEB, RH, PBG), pp. 253–264.
IFL-2008-BrasselF #functional #lazy evaluation #logic programming: From Functional Logic Programs to Purely Functional Programs Preserving Laziness (BB, SF), pp. 25–42.
IFL-2008-ShkaravskaET #functional #semantics: Collected Size Semantics for Functional Programs over Lists (OS, MCJDvE, AT), pp. 118–137.
GT-VMT-2006-Kunert08 #automation #generative #metamodelling #modelling: Semi-automatic Generation of Metamodels and Models From Grammars and Programs (AK), pp. 111–119.
GT-VMT-2008-AzabP #c++ #graph #type checking: Type Checking C++ Template Instantiation by Graph Programs (KA, KHP).
ICGT-2008-AzabH: High-Level Programs and Program Conditions (KA, AH), pp. 211–225.
CHI-2008-ChengET #towards: Participant and interviewer attitudes toward handheld computers in the context of HIV/AIDS programs in sub-Saharan Africa (KGC, FE, KNT), pp. 763–766.
ICEIS-ISAS1-2008-BeckerAP #approach #process: An Approach to Support the Strategic Alignment of Software Process Improvement Programs (ALB, JLNA, RP), pp. 66–73.
ICML-2008-RavikumarAW #convergence #linear #message passing: Message-passing for graph-structured linear programs: proximal projections, convergence and rounding schemes (PDR, AA, MJW), pp. 800–807.
KDD-2008-Sindhgatta #developer #identification: Identifying domain expertise of developers from source code (RS), pp. 981–989.
KR-2008-ClassenL #logic: A Logic for Non-Terminating Golog Programs (JC, GL), pp. 589–599.
KR-2008-DelgrandeSTW #logic programming #semantics #set: Belief Revision of Logic Programs under Answer Set Semantics (JPD, TS, HT, SW), pp. 411–421.
KR-2008-FaberTW #equivalence #logic programming #order: Notions of Strong Equivalence for Logic Programs with Ordered Disjunction (WF, HT, SW), pp. 433–443.
SEKE-2008-BaiL #named #testing: SyncTest: a Tool to Synchronize Source Code, Model and Testing (XB, TL), pp. 723–728.
SEKE-2008-HuS #design pattern #detection #dynamic analysis #java: Dynamic Analysis and Design Pattern Detection in Java Programs (LH, KS), pp. 842–846.
SEKE-2008-Shaffer #domain model #security #static analysis #verification: A Security Domain Model for Static Analysis and Verification of Software Programs (ABS), pp. 673–678.
SEKE-2008-TinkhamTP #assessment #comprehension #java #reverse engineering #testing #tool support: A Qualitative Assessment of the Reverse Engineering Capabilities of Unit Testing Tools for Understanding Java Programs (AT, SRT, TP), pp. 111–116.
BX-2008-Matsuda1 #bidirectional: Bidirectionalization of Programs with Duplication through Complement Function Derivation (KM), p. 40.
ECOOP-2008-TemperoNM #empirical #how #inheritance #java: How Do Java Programs Use Inheritance? An Empirical Study of Inheritance in Java Software (EDT, JN, HM), pp. 667–691.
OOPSLA-2008-DagenaisH #java #static analysis: Enabling static analysis for partial java programs (BD, LJH), pp. 313–328.
OOPSLA-2008-XianSJ #execution #java #parallel #thread: Contention-aware scheduler: unlocking execution parallelism in multithreaded java programs (FX, WSa, HJ), pp. 163–180.
TOOLS-EUROPE-2008-NordioMM #compilation #eiffel: Proof-Transforming Compilation of Eiffel Programs (MN, PM, BM), pp. 316–335.
AdaEurope-2008-FecheteKB #ada #framework #program analysis: A Framework for CFG-Based Static Program Analysis of Ada Programs (RF, GK, JB), pp. 130–143.
AdaEurope-2008-RazaV #detection #flexibility #framework #named #parallel: RCanalyser: A Flexible Framework for the Detection of Data Races in Parallel Programs (AR, GV), pp. 226–239.
LOPSTR-2008-ArroyoRTV #approach #functional #higher-order: A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs (GA, JGR, ST, GV), pp. 40–54.
LOPSTR-2008-LeuschelV #logic programming #partial evaluation #performance #scalability: Fast Offline Partial Evaluation of Large Logic Programs (ML, GV), pp. 119–134.
PADL-2008-EshkevariAC #analysis #aspect-oriented #comprehension #declarative #dependence #reasoning: Comprehension and Dependency Analysis of Aspect-Oriented Programs through Declarative Reasoning (LME, VA, CC), pp. 35–52.
PEPM-2008-LiT #functional #refactoring #tool support: Tool support for refactoring functional programs (HL, SJT), pp. 199–203.
PEPM-2008-PietrzakCPH #analysis #composition #prolog #verification: A practical type analysis for verification of modular prolog programs (PP, JC, GP, MVH), pp. 61–70.
PEPM-2008-PuchingerS #automation #bound: Automating branch-and-bound for dynamic programs (JP, PJS), pp. 81–89.
PLDI-2008-ChughVJL #analysis #concurrent #data flow #detection #using: Dataflow analysis for concurrent programs using datarace detection (RC, JWV, RJ, SL), pp. 316–326.
PLDI-2008-FengSDG #hardware #low level #thread: Certifying low-level programs with hardware interrupts and preemptive threads (XF, ZS, YD, YG), pp. 170–182.
PLDI-2008-FlanaganFY #named #parallel #thread: Velodrome: a sound and complete dynamic atomicity checker for multithreaded programs (CF, SNF, JY), pp. 293–303.
PLDI-2008-HalbwachsP #array: Discovering properties about arrays in simple programs (NH, MP), pp. 339–348.
PLDI-2008-KudlurM #execution #manycore #platform: Orchestrating the execution of stream programs on multicore platforms (MK, SAM), pp. 114–124.
PLDI-2008-Sen #concurrent #random testing #testing: Race directed random testing of concurrent programs (KS), pp. 11–21.
PPDP-2008-ChitilD #algorithm #debugging #finite #functional #higher-order: Comprehending finite maps for algorithmic debugging of higher-order functional programs (OC, TD), pp. 205–216.
PPDP-2008-Hanus #analysis #functional #logic programming: Call pattern analysis for functional logic programs (MH), pp. 67–78.
PPDP-2008-Lu #dependence #logic programming #polymorphism #precise: Inferring precise polymorphic type dependencies in logic programs (LL), pp. 143–151.
QAPL-2008-Smith #abstract interpretation #imperative #probability #using: Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions (MJAS), pp. 43–59.
SAS-2008-LammichM #analysis #concurrent #monitoring #thread: Conflict Analysis of Programs with Procedures, Dynamic Thread Creation, and Monitors (PL, MMO), pp. 205–220.
SAS-2008-RuggieriM #constraints #linear #type system: Typing Linear Constraints for Moding CLP() Programs (SR, FM), pp. 128–143.
SIGAda-2008-Maurer #ada #problem: Removing backward go-to statements from Ada programs: possibilities and problems (WDM), pp. 105–108.
SIGAda-2008-Safari-SharifabadiC #ada #comprehension #dynamic analysis #metric #quality: Dynamic analysis of Ada programs for comprehension and quality measurement (ESS, CC), pp. 15–38.
ASE-2008-BordiniDFF #automation #multi #verification: Automated Verification of Multi-Agent Programs (RHB, LAD, BF, MF), pp. 69–78.
ASE-2008-BrichauKM #using: Enforcing Structural Regularities in Source Code using IntensiVE (JB, AK, KM), pp. 471–472.
ASE-2008-InkumsahX #execution #object-oriented #symbolic computation #testing: Improving Structural Testing of Object-Oriented Programs via Integrating Evolutionary Testing and Symbolic Execution (KI, TX), pp. 297–306.
ASE-2008-Jones #development #predict: Reflections on, and Predictions for, Support Systems for the Development of Programs (CBJ), pp. 7–8.
ASE-2008-JoshiS #java #parallel #predict #thread #type system: Predictive Typestate Checking of Multithreaded Java Programs (PJ, KS), pp. 288–296.
ASE-2008-Papailiopoulou #automation #generative #testing: Automatic Test Generation for LUSTRE/SCADE Programs (VP), pp. 517–520.
ASE-2008-ThummalapentaX #detection #framework #mining #named #open source #web: SpotWeb: Detecting Framework Hotspots and Coldspots via Mining Open Source Code on the Web (ST, TX), pp. 327–336.
ASE-2008-Yom-TovTUH #automation #concurrent #debugging #random: Automatic Debugging of Concurrent Programs through Active Sampling of Low Dimensional Random Projections (EYT, RT, SU, SH), pp. 307–316.
FSE-2008-CottrellWD #reuse: Semi-automating small-scale source code reuse via structural correspondence (RC, RJW, JD), pp. 214–225.
FSE-2008-ParkS #concurrent #detection #random: Randomized active atomicity violation detection in concurrent programs (CSP, KS), pp. 135–145.
ICSE-2008-LauterburgSMV #incremental: Incremental state-space exploration for programs with dynamically allocated data (SL, AS, DM, MV), pp. 291–300.
SAC-2008-DuraoVAM #code search #semantics: Applying a semantic layer in a source code search tool (FAD, TAV, ESdA, SRdLM), pp. 1151–1157.
SAC-2008-LiQWLW #consistency #diagrams #interactive #java #runtime #state machine #uml #verification: UML state machine diagram driven runtime verification of Java programs for message interaction consistency (XL, XQ, LW, BL, WEW), pp. 384–389.
SAC-2008-MeloNX #java #testing #towards #verification: Towards verification and testing of Java programs (ACVdM, PRFN, KSX), pp. 730–734.
SLE-2008-BastenK #fact extraction #named #parametricity: DeFacto: Language-Parametric Fact Extraction from Source Code (BB, PK), pp. 265–284.
CC-2008-LogozzoF #analysis #bytecode #on the: On the Relative Completeness of Bytecode Analysis Versus Source Code Analysis (FL, MF), pp. 197–212.
CGO-2008-BoissinotHGDR #liveness #performance: Fast liveness checking for ssa-form programs (BB, SH, DG, BDdD, FR), pp. 35–44.
CGO-2008-Sarkar #optimisation #parallel: Code optimization of parallel programs: evolutionary vs. revolutionary approaches (VS), p. 1.
DATE-2008-CertnerLPTAD #approach #parallel #performance #predict: A Practical Approach for Reconciling High and Predictable Performance in Non-Regular Parallel Programs (OC, ZL, PP, OT, FA, ND), pp. 740–745.
DATE-2008-GanaiG #smt: Completeness in SMT-based BMC for Software Programs (MKG, AG), pp. 831–836.
DATE-2008-LinF #parallel #performance: Harnessing Horizontal Parallelism and Vertical Instruction Packing of Programs to Improve System Overall Efficiency (HL, YF), pp. 758–763.
HPCA-2008-RashidH #concurrent #parallel #thread: Supporting highly-decoupled thread-level redundancy for parallel programs (MWR, MCH), pp. 393–404.
ISMM-2008-ChinNPQ #bound #low level #memory management: Analysing memory resource bounds for low-level programs (WNC, HHN, CP, SQ), pp. 151–160.
LCTES-2008-DelavalGP #automation #data flow #higher-order #type system: A type system for the automatic distribution of higher-order synchronous dataflow programs (GD, AG, MP), pp. 101–110.
LCTES-2008-NewtonGCMM #compilation #design #embedded #evaluation: Design and evaluation of a compiler for embedded stream programs (RN, LG, MBC, SM, JGM), pp. 131–140.
OSDI-2008-CadarDE #automation #generative #named #testing: KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs (CC, DD, DRE), pp. 209–224.
OSDI-2008-MusuvathiQBBNN #concurrent: Finding and Reproducing Heisenbugs in Concurrent Programs (MM, SQ, TB, GB, PAN, IN), pp. 267–280.
OSDI-2008-WangKKLM #concurrent #named #parallel #thread: Gadara: Dynamic Deadlock Avoidance for Multithreaded Programs (YW, TK, MK, SL, SAM), pp. 281–294.
PPoPP-2008-RulVB #parallel: Extracting coarse-grain parallelism in general-purpose programs (SR, HV, KDB), pp. 281–282.
PPoPP-2008-VakkalankaSGK #model checking #named: ISP: a tool for model checking MPI programs (SSV, SS, GG, RMK), pp. 285–286.
PPoPP-2008-WangYFDWJ #analysis #automation: Automated application-level checkpointing based on live-variable analysis in MPI programs (PW, XY, HF, YD, ZW, JJ), pp. 273–274.
FASE-2008-SmansJPS #automation #java #verification: An Automatic Verifier for Java-Like Programs Based on Dynamic Frames (JS, BJ, FP, WS), pp. 261–275.
STOC-2008-AwerbuchK #distributed #linear: Stateless distributed gradient descent for positive linear programs (BA, RK), pp. 691–700.
TACAS-2008-LalTKR #analysis #bound #concurrent #interprocedural: Interprocedural Analysis of Concurrent Programs Under a Context Bound (AL, TT, NK, TWR), pp. 282–298.
TACAS-2008-LegayMOW #automation #on the #probability #verification: On Automated Verification of Probabilistic Programs (AL, ASM, JO, JW), pp. 173–187.
CAV-2008-AbdullaBCHR #abstraction #memory management: Monotonic Abstraction for Programs with Dynamic Memory Heaps (PAA, AB, JC, FH, AR), pp. 341–354.
CAV-2008-CohenN #concurrent #linear #proving: Local Proofs for Linear-Time Properties of Concurrent Programs (AC, KSN), pp. 149–161.
CAV-2008-FarzanM #concurrent #monitoring: Monitoring Atomicity in Concurrent Programs (AF, PM), pp. 52–65.
CAV-2008-VakkalankaGK #order #reduction #verification: Dynamic Verification of MPI Programs with Reductions in Presence of Split Operations and Relaxed Orderings (SSV, GG, RMK), pp. 66–79.
CSL-2008-HofmannS #pointer: Pure Pointer Programs with Iteration (MH, US), pp. 79–93.
ICLP-2008-BaseliceB: Composing Normal Programs with Function Symbols (SB, PAB), pp. 425–439.
ICLP-2008-CohenSS #algorithm #logic programming: Dynamic Programming Algorithms as Products of Weighted Logic Programs (SBC, RJS, NAS), pp. 114–129.
ICLP-2008-Janhunen #set: Removing Redundancy from Answer Set Programs (TJ), pp. 729–733.
ICLP-2008-JanssenHVC #compilation #fuzzy #set: Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories (JJ, SH, DV, MDC), pp. 362–376.
ICLP-2008-KimmigCRDR #execution #on the #performance: On the Efficient Execution of ProbLog Programs (AK, VSC, RR, BD, LDR), pp. 175–189.
ICLP-2008-LiuY #representation #semantics: Lparse Programs Revisited: Semantics and Representation of Aggregates (GL, JHY), pp. 347–361.
ICLP-2008-MarquesS #concurrent #evaluation: Concurrent and Local Evaluation of Normal Programs (RM, TS), pp. 206–222.
ICLP-2008-PearceV #equilibrium #logic #quantifier #set: Quantified Equilibrium Logic and Foundations for Answer Set Programs (DP, AV), pp. 546–560.
ICLP-2008-PuhrerTW: Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence (JP, HT, SW), pp. 561–575.
ICLP-2008-Riguzzi #logic programming #semantics: Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics (FR), pp. 667–671.
ICLP-2008-SenniPP #algorithm #constraints #logic programming: A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs (VS, AP, MP), pp. 284–300.
ICLP-2008-TruszczynskiW #composition #logic programming: Relativized Hyperequivalence of Logic Programs for Modular Programming (MT, SW), pp. 576–590.
ICLP-2008-VanhoofD #algorithm #logic programming: An Algorithm for Sophisticated Code Matching in Logic Programs (WV, FD), pp. 785–789.
ICST-2008-FerrariMR #aspect-oriented #mutation testing #testing: Mutation Testing for Aspect-Oriented Programs (FCF, JCM, AR), pp. 52–61.
ICST-2008-KimC #object-oriented #sequence #testing: A Fitness Function to Find Feasible Sequences of Method Calls for Evolutionary Testing of Object-Oriented Programs (MK, YC), pp. 537–540.
ICST-2008-LeiWL #concurrent #consistency #diagrams #java #nondeterminism #process #testing #uml: UML Activity Diagram Based Testing of Java Concurrent Programs for Data Race and Inconsistency (BL, LW, XL), pp. 200–209.
ICST-2008-PrasetyaVB #object-oriented #reflexive #testing: Trace-based Reflexive Testing of OO Programs with T2 (WP, TEJV, AIB), pp. 151–160.
IJCAR-2008-BozgaIP #logic: Quantitative Separation Logic and Programs with Lists (MB, RI, SP), pp. 34–49.
ISSTA-2008-KondohO #debugging #interface #java: Finding bugs in java native interface programs (GK, TO), pp. 109–118.
LICS-2008-Kahlon #abstraction #analysis #approach #concurrent #data flow: Parameterization as Abstraction: A Tractable Approach to the Dataflow Analysis of Concurrent Programs (VK), pp. 181–192.
LICS-2008-Murawski #game studies #nondeterminism #reachability #semantics: Reachability Games and Game Semantics: Comparing Nondeterministic Programs (ASM), pp. 353–363.
TAP-2008-VelroyenR #imperative: Non-termination Checking for Imperative Programs (HV, PR), pp. 154–170.
TestCom-FATES-2008-Havelund #c #runtime #verification: Runtime Verification of C Programs (KH), pp. 7–22.
VMCAI-2008-BouissouM #abstract interpretation #embedded #physics: Abstract Interpretation of the Physical Inputs of Embedded Programs (OB, MM), pp. 37–51.
VMCAI-2008-Mendez-LojoH #analysis #precise #set: Precise Set Sharing Analysis for Java-Style Programs (MML, MVH), pp. 172–187.
JCDL-2007-PomerantzOWYF #education #library: Digital library education in computer science programs (JP, SO, BMW, SY, EAF), pp. 177–178.
CSEET-2007-MeadHMRS #on the #re-engineering: On the Feasibility of Specialization within Software Engineering Degree Programs (NRM, TBH, JM, MR, DS), pp. 362–366.
ITiCSE-2007-BrownM #student #visualisation: Visualizing berkeley socket calls in students’ programs (CB, CM), pp. 101–105.
ITiCSE-2007-Helmick #automation #interface #java #programming: Interface-based programming assignments and automatic grading of java programs (MTH), pp. 63–67.
ITiCSE-2007-Impagliazzo #approach #using: Using an outcome-based approach to assess computing programs (JI), p. 344.
ITiCSE-2007-JiWC #detection: A source code linearization technique for detecting plagiarized programs (JHJ, GW, HGC), pp. 73–77.
ITiCSE-2007-JonesB #navigation: Spatial skills and navigation of source code (SJJ, GEB), pp. 231–235.
ITiCSE-2007-SandersT #concept #object-oriented: Checklists for grading object-oriented CS1 programs: concepts and misconceptions (KS, LT), pp. 166–170.
SIGITE-2007-NezlekL: The quest for an administrative nexus for information technology programs (GSN, PML), pp. 151–154.
WCRE-J-2005-KuhnDG07 #clustering #identification #semantics #topic: Semantic clustering: Identifying topics in source code (AK, SD, TG), pp. 230–243.
CSMR-2007-Leitao #approach #framework #java #lisp #migration #platform: Migration of Common Lisp Programs to the Java Platform — The Linj Approach (AML), pp. 243–251.
CSMR-2007-Staiger #static analysis #user interface #visual notation: Static Analysis of Programs with Graphical User Interface (SS), pp. 252–264.
CSMR-2007-SzegediGBGT #concept #java #slicing #verification: Verifying the Concept of Union Slices on Java Programs (AS, TG, ÁB, TG, GT), pp. 233–242.
ICPC-2007-CareyG #automation #concept #identification: Recovering Concepts from Source Code with Automated Concept Identification (MMC, GCG), pp. 27–36.
ICPC-2007-LuccaSFSH #aspect-oriented #challenge #roadmap: Comprehending Aspect-Oriented Programs: Challenges and Open Issues (GADL, MS, BF, ES, HJH), pp. 286–292.
ICPC-2007-PoshyvanykM #concept analysis #information retrieval: Combining Formal Concept Analysis with Information Retrieval for Concept Location in Source Code (DP, AM), pp. 37–48.
ICPC-2007-RatiuD: From Reality to Programs and (Not Quite) Back Again (DR, FD), pp. 91–102.
ICPC-2007-ShearerC #constraints: Enforcing Constraints Between Documentary Comments and Source Code (CDS, MLC), pp. 271–280.
ICPC-2007-Vivanco #algorithm #complexity #identification #metric #modelling #predict #search-based #using: Use of a Genetic Algorithm to Identify Source Code Metrics Which Improves Cognitive Complexity Predictive Models (RAV), pp. 297–300.
ICSM-2007-CorboGP #learning: Smart Formatter: Learning Coding Style from Existing Source Code (FC, CDG, MDP), pp. 525–526.
ICSM-2007-OezbekP #comprehension #documentation #named: JTourBus: Simplifying Program Understanding by Documentation that Provides Tours Through the Source Code (CO, LP), pp. 64–73.
MSR-2007-CanforaCP #identification #repository: Identifying Changed Source Code Lines from Version Repositories (GC, LC, MDP), p. 14.
MSR-2007-KagdiCM #mining: Comparing Approaches to Mining Source Code for Call-Usage Patterns (HHK, MLC, JIM), p. 20.
PASTE-2007-XuPV #analysis #java: Dynamic purity analysis for java programs (HX, CJFP, CV), pp. 75–82.
SCAM-2007-GiffhornH #algorithm #concurrent #evaluation #slicing: An Evaluation of Slicing Algorithms for Concurrent Programs (DG, CH), pp. 17–26.
SCAM-2007-Johannes #composition #framework #reuse: Source Code Composition with the Reuseware Composition Framework (JJ), pp. 159–160.
SCAM-2007-MolinaS #approximate #open source #performance #using: Fast Approximate Matching of Programs for Protecting Libre/Open Source Software by Using Spatial Indexes (AJMM, TS), pp. 111–122.
SCAM-2007-MoorVHAEOST #analysis: Keynote Address: .QL for Source Code Analysis (OdM, MV, EH, PA, TE, NO, DS, JT), pp. 3–16.
WCRE-2007-FluriWG: Do Code and Comments Co-Evolve? On the Relation between Source Code and Comment Changes (BF, MW, HG), pp. 70–79.
ICALP-2007-LeePP #alias: Aliased Register Allocation for Straight-Line Programs Is NP-Complete (JKL, JP, FMQP), pp. 680–691.
LATA-2007-AblayevG #branch #complexity #quantum #simulation: Classical Simulation Complexity of Quantum Branching Programs (FMA, AG), pp. 49–56.
SEFM-2007-BeckertK #concurrent #deduction #logic #verification: A Dynamic Logic for Deductive Verification of Concurrent Programs (BB, VK), pp. 141–150.
SEFM-2007-Cook #automation #concurrent #proving: Automatically Proving Concurrent Programs Correct (BC), pp. 269–272.
SEFM-2007-CrockerC #automation #c #reasoning #using #verification: Verification of C Programs Using Automated Reasoning (DC, JC), pp. 7–14.
SEFM-2007-DengRH #algorithm #execution #object-oriented #symbolic computation #towards: Towards A Case-Optimal Symbolic Execution Algorithm for Analyzing Strong Properties of Object-Oriented Programs (XD, R, JH), pp. 273–282.
CEFP-2007-MolEP #functional #lazy evaluation #proving: Proving Properties of Lazy Functional Programs with Sparkle (MdM, MCJDvE, RP), pp. 41–86.
ICFP-2007-Jones #haskell: Call-pattern specialisation for haskell programs (SLPJ), pp. 327–337.
ICFP-2007-Sereni #analysis #functional #graph #higher-order #termination: Termination analysis and call graph construction for higher-order functional programs (DS), pp. 71–84.
IFL-2007-BrasselS #debugging #functional #lazy evaluation: Debugging Lazy Functional Programs by Asking the Oracle (BB, HS), pp. 183–200.
VISSOFT-2007-BohnerGHM #analysis #uml #using #visual notation #visualisation: Evolutional Insights from UML and Source Code Versions using Information Visualization and Visual Analysis (SAB, DG, TH, KM), pp. 145–148.
VISSOFT-2007-BohnetD #2d #graph #visualisation: Facilitating Exploration of Unfamiliar Source Code by Providing 21/2D Visualizations of Dynamic Call Graphs (JB, JD), pp. 63–66.
VISSOFT-2007-HolmesW #dependence: Task-specific source code dependency investigation (RH, RJW), pp. 100–107.
VISSOFT-2007-VoineaT #debugging #process #repository #visualisation: Visualizing Debugging Activity in Source Code Repositories (LV, ACT), pp. 156–157.
SEKE-2007-KuoSSTZ #random testing #testing: Enhanced Random Testing for Programs with High Dimensional Input Domains (FCK, KYS, CaS, SFT, ZZ), pp. 135–140.
SEKE-2007-MonteiroOG #implementation #user interface #using: A Proposal to Delegate GUI Implementation using a Source Code based Model (MM, PO, RG), pp. 29–32.
SEKE-2007-RushtonT #reasoning: A Language Facilitating Informal Reasoning about Programs (JNR, DT), p. 396–?.
OOPSLA-2007-ShanerLN #composition #higher-order #verification: Modular verification of higher-order methods with mandatory calls specified by model programs (SMS, GTL, DAN), pp. 351–368.
TOOLS-EUROPE-2007-HorieC #aspectj #named: AspectScope: An Outline Viewer for AspectJ Programs (MH, SC), pp. 341–361.
AdaEurope-2007-BliebergerBM #ada #detection #multi #static analysis: Static Detection of Livelocks in Ada Multitasking Programs (JB, BB, RM), pp. 69–83.
LOPSTR-2007-CasasCH #algorithm #independence #logic programming #strict: Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs (AC, MC, MVH), pp. 138–153.
LOPSTR-2007-DegraveV #normalisation #towards: Towards a Normal Form for Mercury Programs (FD, WV), pp. 43–58.
LOPSTR-2007-FischerSTV #functional #lazy evaluation #partial evaluation: Preserving Sharing in the Partial Evaluation of Lazy Functional Programs (SF, JS, ST, GV), pp. 74–89.
LOPSTR-2007-Mendez-LojoNH #analysis #approach #flexibility #object-oriented: A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs (MML, JAN, MVH), pp. 154–168.
LOPSTR-2007-NguyenGSS #analysis #dependence #graph #logic programming #termination: Termination Analysis of Logic Programs Based on Dependency Graphs (MTN, JG, PSK, DDS), pp. 8–22.
PADL-2007-AlbertGHP #analysis #bytecode #java #logic programming #using #verification: Verification of Java Bytecode Using Analysis and Transformation of Logic Programs (EA, MGZ, LH, GP), pp. 124–139.
PEPM-2007-CunhaV #query #xpath: Transformation of structure-shy programs: applied to XPath queries and strategic functions (AC, JV), pp. 11–20.
PEPM-2007-FernandesS #library #tool support: Tools and libraries to model and manipulate circular programs (JPF, JS), pp. 102–111.
PEPM-2007-Hamilton #named: Distillation: extracting the essence of programs (GWH), pp. 61–70.
PEPM-2007-RooverDBND #behaviour #logic #query #similarity #using: Behavioral similarity matching using concrete source code templates in logic queries (CDR, TD, JB, CN, LD), pp. 92–101.
PEPM-2007-Vidal #logic programming #partial evaluation #termination: Quasi-terminating logic programs for ensuring the termination of partial evaluation (GV), pp. 51–60.
PLDI-2007-MoritaMMHT #automation #divide and conquer #parallel: Automatic inversion generates divide-and-conquer parallel programs (KM, AM, KM, ZH, MT), pp. 146–155.
PLDI-2007-MusuvathiQ #bound #parallel #testing #thread: Iterative context bounding for systematic testing of multithreaded programs (MM, SQ), pp. 446–455.
POPL-2007-CookGPRV #proving: Proving that programs eventually do something good (BC, AG, AP, AR, MYV), pp. 265–276.
POPL-2007-JhalaM #analysis #interprocedural: Interprocedural analysis of asynchronous programs (RJ, RM), pp. 339–350.
POPL-2007-MatthewsF #multi #semantics: Operational semantics for multi-language programs (JM, RBF), pp. 3–10.
POPL-2007-Might #analysis #higher-order: Logic-flow analysis of higher-order programs (MM), pp. 185–198.
PPDP-2007-Charatonik #logic programming: Regular directional types for logic programs (WC), p. 209.
PPDP-2007-FischerK #functional #generative #logic programming #testing: Systematic generation of glass-box test cases for functional logic programs (SF, HK), pp. 63–74.
PPDP-2007-Sagonas #detection #erlang #fault #static analysis #using: Detecting defects in Erlang programs using static analysis (KFS), p. 37.
QAPL-2007-Smith #communication #modelling #probability #protocol: Stochastic Modelling of Communication Protocols from Source Code (MJAS), pp. 129–145.
SAS-2007-KamilY #analysis #distributed #pointer: Hierarchical Pointer Analysis for Distributed Programs (AK, KAY), pp. 281–297.
SAS-2007-Monniaux #abstraction: Optimal Abstraction on Real-Valued Programs (DM), pp. 104–120.
SIGAda-2007-Lau #imperative #reasoning #using: Using SPARK for a beginner’s course on reasoning about imperative programs (KKL), pp. 75–78.
ASE-2007-Abi-AntounA #execution #object-oriented #tool support: Tool support for the compile-time execution structure of object-oriented programs with ownership annotations (MAA, JA), pp. 543–544.
ASE-2007-ArcuriY #specification #testing: Coevolving programs and unit tests from their specification (AA, XY), pp. 397–400.
ASE-2007-ChenM #concurrent #testing #using: Testing concurrent programs using value schedules (JC, SM), pp. 313–322.
ASE-2007-InkumsahX #framework #named #object-oriented #testing: Evacon: a framework for integrating evolutionary and concolic testing for object-oriented programs (KI, TX), pp. 425–428.
ASE-2007-Kagdi #fine-grained #mining #predict: Improving change prediction with fine-grained source code mining (HHK), pp. 559–562.
ASE-2007-LemosBOMMBL #named #reuse #using: CodeGenie: using test-cases to search and reuse source code (OALL, SKB, JO, RSM, PCM, PB, CVL), pp. 525–526.
ASE-2007-Sen #concurrent #effectiveness #random testing #testing: Effective random testing of concurrent programs (KS), pp. 323–332.
ASE-2007-ThummalapentaX #named #open source #reuse #web: Parseweb: a programmer assistant for reusing open source code on the web (ST, TX), pp. 204–213.
ESEC-FSE-2007-AcharyaXPX #api #mining #partial order #specification: Mining API patterns as partial orders from source code: from usage scenarios to specifications (MA, TX, JP, JX), pp. 25–34.
ICSE-2007-ChesleyRRT #fault #java #locality: Crisp- A Fault Localization Tool for Java Programs (OCC, XR, BGR, FT), pp. 775–779.
ICSE-2007-DigMJN #configuration management #object-oriented #refactoring: Refactoring-Aware Configuration Management for Object-Oriented Programs (DD, KM, REJ, TNN), pp. 427–436.
ICSE-2007-LivieriHMI #analysis #distributed #open source #using #visualisation: Very-Large Scale Code Clone Analysis and Visualization of Open Source Programs Using Distributed CCFinder: D-CCFinder (SL, YH, MM, KI), pp. 106–115.
CGO-2007-FultonS #compilation #java #realtime: Compilation Techniques for Real-Time Java Programs (MF, MGS), pp. 221–231.
CGO-2007-RamanHM #layout #optimisation #parallel #thread: Structure Layout Optimization for Multithreaded Programs (ER, RH, SM), pp. 271–282.
COCV-2007-Hamilton #verification: Distilling Programs for Verification (GWH), pp. 17–32.
DATE-2007-KraemerLAM #interactive #parallel #program transformation #using: Interactive presentation: SoftSIMD — exploiting subword parallelism using source code transformations (SK, RL, GA, HM), pp. 1349–1354.
DATE-2007-SanchezSSR #automation #effectiveness #generative #interactive: Interactive presentation: An enhanced technique for the automatic generation of effective diagnosis-oriented test programs for processor (ES, MS, GS, MSR), pp. 1158–1163.
PPoPP-2007-AgarwalBSS #analysis: May-happen-in-parallel analysis of X10 programs (SA, RB, VS, RKS), pp. 183–193.
PPoPP-2007-ZhangD: Barrier matching for programs with textually unaligned barriers (YZ, ED), pp. 194–204.
WRLA-2006-NeuhausserN07 #abstraction #erlang #maude #model checking: Abstraction and Model Checking of Core Erlang Programs in Maude (MRN, TN), pp. 147–163.
ESOP-2007-DreyerB #composition: Principal Type Schemes for Modular Programs (DD, MB), pp. 441–457.
ESOP-2007-RinetzkyPRSY #analysis #composition #encapsulation: Modular Shape Analysis for Dynamically Encapsulated Programs (NR, APH, GR, MS, EY), pp. 220–236.
FASE-2007-Lopez-HerrejonA #case study #metric: Measuring and Characterizing Crosscutting in Aspect-Based Programs: Basic Metrics and Case Studies (RELH, SA), pp. 423–437.
STOC-2007-AroraK #approach #combinator: A combinatorial, primal-dual approach to semidefinite programs (SA, SK), pp. 227–236.
TACAS-2007-ArmandoBM #abstraction #array #linear #refinement: Abstraction Refinement of Linear Programs with Arrays (AA, MB, JM), pp. 373–388.
TACAS-2007-FarzanM #analysis #concurrent #data flow: Causal Dataflow Analysis for Concurrent Programs (AF, PM), pp. 102–116.
TACAS-2007-HarelS #flexibility: Planned and Traversable Play-Out: A Flexible Method for Executing Scenario-Based Programs, (DH, IS), pp. 485–499.
CADE-2007-MurkLH #c #named #verification: KeY-C: A Tool for Verification of C Programs (OM, DL, RH), pp. 385–390.
CAV-2007-BouajjaniFQ #analysis #bound #parallel #thread: Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures (AB, SF, SQ), pp. 207–220.
CAV-2007-KahlonYSG #concurrent #detection #performance: Fast and Accurate Static Data-Race Detection for Concurrent Programs (VK, YY, SS, AG), pp. 226–239.
CAV-2007-PatinST #named #parallel #recursion #thread #verification: Spade: Verification of Multithreaded Dynamic and Recursive Programs (GP, MS, TT), pp. 254–257.
CAV-2007-SuwimonteerabuthBSE #java #named #testing: jMoped: A Test Environment for Java Programs (DS, FB, SS, JE), pp. 164–167.
CSL-2007-Beckmann #complexity #proving: Proofs, Programs and Abstract Complexity (AB), pp. 4–5.
ICLP-2007-BaseliceBC #on the #recursion: On Finitely Recursive Programs (SB, PAB, GC), pp. 89–103.
ICLP-2007-CabalarPV #logic programming: Minimal Logic Programs (PC, DP, AV), pp. 104–118.
ICLP-2007-CaliL #logic programming #probability #semantics #web: Tightly Integrated Probabilistic Description Logic Programs for the Semantic Web (AC, TL), pp. 428–429.
ICLP-2007-FalaschiOPV #concurrent #constraints #declarative: Declarative Diagnosis of Temporal Concurrent Constraint Programs (MF, CO, CP, FV), pp. 271–285.
ICLP-2007-JarvisaloO #logic programming: Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs (MJ, EO), pp. 134–148.
ICLP-2007-LiuPST #constraints #logic programming: Logic Programs with Abstract Constraint Atoms: The Role of Computations (LL, EP, TCS, MT), pp. 286–301.
ICLP-2007-NavasMLH #analysis #bound #logic programming: User-Definable Resource Bounds Analysis for Logic Programs (JAN, EM, PLG, MVH), pp. 348–363.
ICLP-2007-PietrzakH #automation #fault #logic programming: Automatic Binding-Related Error Diagnosis in Logic Programs (PP, MVH), pp. 333–347.
ICLP-2007-Wong #equivalence #logic programming: A Stronger Notion of Equivalence for Logic Programs (KSW), pp. 453–454.
ISSTA-2007-dAmorimLM #execution #object-oriented #performance: Delta execution for efficient state-space exploration of object-oriented programs (Md, SL, DM), pp. 50–60.
ISSTA-2007-TallamTGZ #execution #parallel #reduction #thread: Enabling tracing Of long-running multithreaded programs via dynamic execution reduction (ST, CT, RG, XZ), pp. 207–218.
TAP-2007-BackEM #invariant #testing #verification: Testing and Verifying Invariant Based Programs in the SOCOS Environment (RJB, JE, MM), pp. 61–78.
TAP-2007-RummerS #calculus #java #logic #proving #using: Proving Programs Incorrect Using a Sequent Calculus for Java Dynamic Logic (PR, MAS), pp. 41–60.
VMCAI-2007-BallK #approximate: Better Under-Approximation of Programs by Hiding Variables (TB, OK), pp. 314–328.
VMCAI-2007-BozgaI #on the: On Flat Programs with Lists (MB, RI), pp. 122–136.
VMCAI-2007-RakamaricBH #data type #verification: An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures (ZR, JDB, AJH), pp. 106–121.
VMCAI-2007-Siegel #model checking: Model Checking Nonblocking MPI Programs (SFS), pp. 44–58.
SCAM-J-2005-AntoniolKT06 #analysis: Special issue on Source code analysis and manipulation (GA, JK, PT), pp. 205–208.
CSMR-2006-MensK: IntensiVE, a toolsuite for documenting and checking structural source-code regularities (KM, AK), pp. 239–248.
ICPC-2006-DesmondSE: Fluid Source Code Views (MD, MADS, CE), pp. 260–263.
ICPC-2006-LuciaOZP #empirical #information management #traceability: Improving Comprehensibility of Source Code via Traceability Information: a Controlled Experiment (ADL, RO, FZ, MDP), pp. 317–326.
ICPC-2006-PhengV #analysis #data type #java: Dynamic Data Structure Analysis for Java Programs (SP, CV), pp. 191–201.
ICPC-2006-PoshyvanykMD #eclipse #named #plugin: JIRiSS — an Eclipse plug-in for Source Code Exploration (DP, AM, YD), pp. 252–255.
ICPC-2006-RatiuD #knowledge base: Programs are Knowledge Bases (DR, FD), pp. 79–83.
ICSM-2006-GoldHLM #approach #bound #concept #using: Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding (NG, MH, ZL, KM), pp. 310–319.
ICSM-2006-Hou #constraints #design #using: Using Structural Constraints to Specify and Check Design Intent in Source Code — Ph.D. Dissertation Synopsis (DH), pp. 343–346.
ICSM-2006-PoshyvanykPMXL: Source Code Exploration with Google (DP, MP, AM, XX, DL), pp. 334–338.
ICSM-2006-Robillard #empirical #evolution: Tracking Concerns in Evolving Source Code: An Empirical Study (MPR), pp. 479–482.
ICSM-2006-YaoMKB #automation #c #metaprogramming #program transformation: C Macro Handling in Automated Source Code Transformation Systems (BY, WM, SK, RB), pp. 68–69.
MSR-2006-KnabPB #fault #predict: Predicting defect densities in source code files with decision tree learners (PK, MP, AB), pp. 119–125.
SCAM-2006-HenriksenG #abstract interpretation #logic programming: Abstract Interpretation of PIC Programs through Logic Programming (KSH, JPG), pp. 184–196.
SCAM-2006-LiT #case study #comparative #erlang #haskell #refactoring: Comparative Study of Refactoring Haskell and Erlang Programs (HL, SJT), pp. 197–206.
WCRE-2006-GanesanMKY #aspect-oriented #case study #product line: Discovering Organizational Aspects from the Source Code History Log during the Product Line Planning Phase — A Case Study (DG, DM, JK, KY), pp. 211–220.
WCRE-2006-KorshunovaPBM #c++ #diagrams #named #process #reverse engineering #sequence #uml #xmi: CPP2XMI: Reverse Engineering of UML Class, Sequence, and Activity Diagrams from C++ Source Code (EK, MP, MvdB, MRM), pp. 297–298.
WCRE-2006-RatiuD #how: How Programs Represent Reality (and how they don’t) (DR, FD), pp. 83–92.
CIAA-2006-Luttenberger #analysis #integer #reachability: Reachability Analysis of Procedural Programs with Affine Integer Arithmetic (ML), pp. 281–282.
FM-2006-BannwartM #refactoring #specification: Changing Programs Correctly: Refactoring with Specifications (FB, PM), pp. 492–507.
RTA-2006-BouajjaniE #modelling: Rewriting Models of Boolean Programs (AB, JE), pp. 136–150.
SEFM-2006-Khedker #perspective #static analysis: Static Analysis of Programs: A Heap Centric View (UPK), p. 261.
ICFP-2006-Shapiro #concurrent #proving: Practical proofs of concurrent programs (MS), p. 123.
ICFP-2006-ZiarekSJ #abstraction #composition #concurrent #functional #named: Stabilizers: a modular checkpointing abstraction for concurrent functional programs (LZ, PS, SJ), pp. 136–147.
IFL-2006-TrojahnerGS #array #on the #optimisation #using: On Optimising Shape-Generic Array Programs Using Symbolic Structural Information (KT, CG, SBS), pp. 1–18.
ICGT-2006-HabelPR: Weakest Preconditions for High-Level Programs (AH, KHP, AR), pp. 445–460.
CHI-2006-JakobsenH: Evaluating a fisheye view of source code (MRJ, KH), pp. 377–386.
SOFTVIS-2006-SajaniemiBG #animation #object-oriented: Metaphor-based animation of OO programs (JS, PB, PG), pp. 173–174.
SOFTVIS-2006-TanimotoL #interface: A transparent interface to state-space search programs (SLT, SL), pp. 151–152.
KR-2006-BaierM #on the: On Planning with Programs that Sense (JAB, SAM), pp. 492–502.
KR-2006-ChenLWZ #first-order #logic programming: First-Order Loop Formulas for Normal Logic Programs (YC, FL, YW, MZ), pp. 298–307.
KR-2006-ClassenL #knowledge-based #using: Foundations for Knowledge-Based Programs using ES (JC, GL), pp. 318–328.
KR-2006-Straccia #logic programming #query: Query Answering under the Any-World Assumption for Normal Logic Programs (US), pp. 329–339.
KR-2006-Zhang #logic programming: Computational Properties of Epistemic Logic Programs (YZ), pp. 308–317.
ECOOP-2006-HajiyevVM #datalog #named #query #scalability: codeQuest: Scalable Source Code Queries with Datalog (EH, MV, OdM), pp. 2–27.
AdaEurope-2006-BreuerP #fault #kernel #linux #static analysis: One Million (LOC) and Counting: Static Analysis for Errors and Vulnerabilities in the Linux Kernel Source Code (PTB, SP), pp. 56–70.
AdaEurope-2006-LiWQLYZZ #java #runtime #specification #verification: Runtime Verification of Java Programs for Scenario-Based Specifications (XL, LW, XQ, BL, JY, JZ, GZ), pp. 94–105.
LOPSTR-2006-LeuschelCE #logic programming #online #partial evaluation #using: Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques (ML, SJC, DE), pp. 43–59.
LOPSTR-2006-SakamaI #logic programming: Constructing Consensus Logic Programs (CS, KI), pp. 26–42.
LOPSTR-2006-Schneider-KampGST #analysis #automation #logic programming #term rewriting #termination: Automated Termination Analysis for Logic Programs by Term Rewriting (PSK, JG, AS, RT), pp. 177–193.
PADL-2006-SahaR #evaluation #incremental #logic programming #prolog: Incremental Evaluation of Tabled Prolog: Beyond Pure Logic Programs (DS, CRR), pp. 215–229.
POPL-2006-AmtoftBB #data flow #logic #object-oriented: A logic for information flow in object-oriented programs (TA, SB, AB), pp. 91–102.
POPL-2006-KoutavasW #bisimulation #higher-order #imperative #reasoning: Small bisimulations for reasoning about higher-order imperative programs (VK, MW), pp. 141–152.
PPDP-2006-GnaedigK: Computing constructor forms with non terminating rewrite programs (IG, HK), pp. 121–132.
PPDP-2006-Miller #analysis #horn clause: Collection analysis for Horn clause programs (DM), pp. 179–188.
PPDP-2006-Sulzmann #proving: Extracting programs from type class proofs (MS), pp. 97–108.
SAS-2006-AllamigeonGH #c #embedded #static analysis #string: Static Analysis of String Manipulations in Critical Embedded C Programs (XA, WG, CH), pp. 35–51.
ASE-2006-Jurjens #analysis #automation #java #proving #security #theorem proving #using: Security Analysis of Crypto-based Java Programs using Automated Theorem Provers (JJ), pp. 167–176.
ASE-2006-ShiO #design pattern #java #reverse engineering: Reverse Engineering of Design Patterns from Java Source Code (NS, RAO), pp. 123–134.
ASE-2006-WeissgerberD #identification #refactoring: Identifying Refactorings from Source-Code Changes (PW, SD), pp. 231–240.
FSE-2006-LuCT #approach #data flow #middleware #testing: Testing context-aware middleware-centric programs: a data flow approach and an RFID-based experimentation (HL, WKC, THT), pp. 242–252.
FSE-2006-StorzerRRT #classification #java #using: Finding failure-inducing changes in java programs using change classification (MS, BGR, XR, FT), pp. 57–68.
FSE-2006-ZhangTG #execution #performance #slicing: Dynamic slicing long running programs through execution fast forwarding (XZ, ST, RG), pp. 81–91.
ICSE-2006-BoshernitsanG #eclipse #interactive #java: Interactive transformation of java programs in eclipse (MB, SLG), pp. 791–794.
ICSE-2006-FrantzeskouSGK #effectiveness #identification #using: Effective identification of source code authors using byte-level information (GF, ES, SG, SKK), pp. 893–896.
ICSE-2006-JiangS #c #correctness #named #type system #validation: Osprey: a practical type system for validating dimensional unit correctness of C programs (LJ, ZS), pp. 262–271.
ICSE-2006-MaHK #evaluation #mutation testing #object-oriented #testing: Evaluation of mutation testing for object-oriented programs (YSM, MJH, YRK), pp. 869–872.
ICSE-2006-Sindhgatta #information retrieval #using: Using an information retrieval system to retrieve source code samples (RS), pp. 905–908.
ICSE-2006-XiePM #3d #concept #visualisation: 3D visualization for concept location in source code (XX, DP, AM), pp. 839–842.
SAC-2006-DubeyJA #keyword: A deterministic technique for extracting keyword based grammar rules from programs (AD, PJ, SKA), pp. 1631–1632.
ASPLOS-2006-GordonTA #parallel #pipes and filters: Exploiting coarse-grained task, data, and pipeline parallelism in stream programs (MIG, WT, SPA), pp. 151–162.
ASPLOS-2006-Solar-LezamaTBSS #combinator #finite #sketching: Combinatorial sketching for finite programs (ASL, LT, RB, SAS, VAS), pp. 404–415.
CC-2006-HackGG: Register Allocation for Programs in SSA-Form (SH, DG, GG), pp. 247–262.
DATE-2006-ParkOPSH #embedded: Dynamic code overlay of SDF-modeled programs on low-end embedded systems (HwP, KO, SP, MmS, SH), pp. 945–946.
HPCA-2006-ChungCMMCKO #behaviour #parallel #thread #transaction: The common case transactional behavior of multithreaded programs (JC, HC, CCM, AM, BDC, CK, KO), pp. 266–277.
HPDC-2006-ChungH #automation #case study #performance #scalability #using: A Case Study Using Automatic Performance Tuning for Large-Scale Scientific Programs (IHC, JKH), pp. 45–56.
LCTES-2006-Mine #analysis #c #embedded #pointer: Field-sensitive value analysis of embedded C programs with union types and pointer arithmetics (AM), pp. 54–63.
PDP-2006-BorkowskiKT #grid #parallel #using: Application Control on Grid Using Predicates Defined on Global States of Co-Operating Parallel Programs (JB, DK, MT), pp. 248–255.
PDP-2006-LaskowskiT #branch #configuration management #scheduling: Scheduling Programs with Conditional Branches for Look-Ahead Dynamically Reconfigurable Systems (EL, MT), pp. 211–218.
PPoPP-2006-FernandesPS #mobile: Mobile MPI programs in computational grids (RF, KP, PS), pp. 22–31.
PPoPP-2006-SpringerLRF #clustering #energy #execution: Minimizing execution time in MPI programs on an energy-constrained, power-scalable cluster (RS, DKL, BR, VWF), pp. 230–238.
PPoPP-2006-WangS #concurrent #detection #fault #performance #runtime: Accurate and efficient runtime detection of atomicity errors in concurrent programs (LW, SDS), pp. 137–146.
ESOP-2006-JiaW #automation #named #pointer #reasoning: ILC: A Foundation for Automated Reasoning About Pointer Programs (LJ, DW), pp. 131–145.
ESOP-2006-LalLPL #debugging #optimisation: Path Optimization in Programs and Its Application to Debugging (AL, JL, MP, BL), pp. 246–263.
FASE-2006-SenA #automation #distributed #testing: Automated Systematic Testing of Open Distributed Programs (KS, GA), pp. 339–356.
FoSSaCS-2006-LodingS #logic #recursion: Propositional Dynamic Logic with Recursive Programs (CL, OS), pp. 292–306.
TACAS-2006-ChakiCKRT #c #concurrent #message passing #recursion #verification: Verifying Concurrent Message-Passing C Programs with Recursive Calls (SC, EMC, NK, TWR, TT), pp. 334–349.
TACAS-2006-DwyerHHRRW #concurrent #effectiveness #object-oriented #reduction #slicing: Evaluating the Effectiveness of Slicing for Model Reduction of Concurrent Object-Oriented Programs (MBD, JH, MH, VPR, R, TW), pp. 73–89.
TACAS-2006-GhicaM #composition #concurrent #higher-order: Compositional Model Extraction for Higher-Order Concurrent Programs (DRG, ASM), pp. 303–317.
TACAS-2006-HabermehlIV #verification: Automata-Based Verification of Programs with Tree Updates (PH, RI, TV), pp. 350–364.
CAV-2006-BerdineCDO #automation #proving #termination: Automatic Termination Proofs for Programs with Shape-Shifting Heaps (JB, BC, DD, PWO), pp. 386–400.
CAV-2006-BouajjaniBHIMV #automaton: Programs with Lists Are Counter Automata (AB, MB, PH, RI, PM, TV), pp. 517–531.
CAV-2006-Braverman #integer #linear #termination: Termination of Integer Linear Programs (MB), pp. 372–385.
CAV-2006-GriesmayerBC #c: Repair of Boolean Programs with an Application to C (AG, RB, BC), pp. 358–371.
CAV-2006-Harel #aspect-oriented #game studies #verification: Playing with Verification, Planning and Aspects: Unusual Methods for Running Scenario-Based Programs (DH), pp. 3–4.
CAV-2006-KahlonGS #concurrent #model checking #on the fly #partial order #transaction #using: Symbolic Model Checking of Concurrent Programs Using Partial Orders and On-the-Fly Transactions (VK, AG, NS), pp. 286–299.
CAV-2006-SenV #model checking #parallel #thread: Model Checking Multithreaded Programs with Asynchronous Atomic Methods (KS, MV), pp. 300–314.
CSL-2006-ChadhaMS #probability #reasoning: Reasoning About States of Probabilistic Sequential Programs (RC, PM, AS), pp. 240–255.
ICLP-2006-AntoyH #functional #logic programming: Overlapping Rules and Logic Variables in Functional Logic Programs (SA, MH), pp. 87–101.
ICLP-2006-Cheney #logic programming #semantics: The Semantics of Nominal Logic Programs (JC), pp. 361–375.
ICLP-2006-KingLG #detection #prolog: Detecting Determinacy in Prolog Programs (AK, LL, SG), pp. 132–147.
ICLP-2006-Lam #datalog #question #why: Why Use Datalog to Analyze Programs? (MSL), p. 1.
ICLP-2006-PettorossiPS #constraints #logic programming #proving: Proving Properties of Constraint Logic Programs by Eliminating Existential Variables (AP, MP, VS), pp. 179–195.
ICLP-2006-PhanJ #memory management #towards: Towards Region-Based Memory Management for Mercury Programs (QP, GJ), pp. 433–435.
ICLP-2006-PontelliS #logic programming #semantics #set: Justifications for Logic Programs Under Answer Set Semantics (EP, TCS), pp. 196–210.
ICLP-2006-Rocha #logic programming: Handling Incomplete and Complete Tables in Tabled Logic Programs (RR), pp. 427–428.
ICLP-2006-SahaR #algorithm #evaluation #incremental #logic programming: A Local Algorithm for Incremental Evaluation of Tabled Logic Programs (DS, CRR), pp. 56–71.
ICLP-2006-Wong #logic programming: Deducing Logic Programs (KSW), pp. 471–472.
IJCAR-2006-ConstableM #proving #semantics: Extracting Programs from Constructive HOL Proofs Via IZF Set-Theoretic Semantics (RLC, WM), pp. 162–176.
ISSTA-2006-SiegelMAC #execution #model checking #parallel #symbolic computation #using #verification: Using model checking with symbolic execution to verify parallel numerical programs (SFS, AM, GSA, LAC), pp. 157–168.
LICS-2006-Leivant #logic #proving #reasoning: Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic (DL), pp. 157–168.
VMCAI-2006-BalabanCP #abstraction #ranking #recursion: Ranking Abstraction of Recursive Programs (IB, AC, AP), pp. 267–281.
VMCAI-2006-BinghamR #abstraction #logic: A Logic and Decision Procedure for Predicate Abstraction of Heap-Manipulating Programs (JDB, ZR), pp. 207–221.
ITiCSE-2005-FossumH #assessment: A new quantitative assessment tool for computer science programs (TVF, SMH), pp. 153–157.
ITiCSE-2005-KayHR #design: Extending undergraduate CS programs with informatics: emphasizing software and system design in context (DGK, AvdH, DJR), p. 367.
SIGITE-2005-LongeneckerF #assessment #certification #development: Development of assessment for undergraduate programs of information technology, and certification for program graduates (HELJ, DLF), pp. 163–166.
SIGITE-2005-Subramaniam #question: The emergence of IT degree programs: when did it happen? (MMS), pp. 31–35.
CSMR-2005-DraheimLW #independence #reverse engineering #web: A Source Code Independent Reverse Engineering Tool for Dynamic Web Sites (DD, CL, GW), pp. 168–177.
CSMR-2005-DubeyAJ #keyword #set: A Technique for Extracting Keyword Based Rules from a Set of Programs (AD, SKA, PJ), pp. 217–225.
CSMR-2005-KarailaS #analysis #case study #industrial #maintenance #visual notation: Maintenance and Analysis of Visual Programs — An Industrial Case (MK, TS), pp. 158–167.
CSMR-2005-RousidisT #case study #clustering #java #maintenance: Clustering Data Retrieved from Java Source Code to Support Software Maintenance: A Case Study (DR, CT), pp. 276–279.
ICSM-2005-ChesleyRR #debugging #java #named: Crisp: A Debugging Tool for Java Programs (OCC, XR, BGR), pp. 401–410.
ICSM-2005-MarcusR #concept #identification: Identifications of Concepts, Features, and Concerns in Source Code (AM, VR), p. 718.
ICSM-2005-MensK #framework #testing #towards: Towards a Framework for Testing Structural Source-Code Regularities (KM, AK), pp. 679–682.
ICSM-IT-2005-PoshyvanykMDS #named: IRiSS — A Source Code Exploration Tool (DP, AM, YD, AS), pp. 69–72.
IWPC-2005-CoxC #comprehension: Working Session: Textual Views of Source Code to Support Comprehension (AC, MLC), pp. 109–112.
IWPC-2005-WalkinshawRW #behaviour #comprehension #object-oriented #perspective: Understanding Object-Oriented Source Code from the Behavioural Perspective (NW, MR, MW), pp. 215–224.
MSR-2005-KagdiCM #mining #repository #taxonomy #towards: Towards a taxonomy of approaches for mining of source code repositories (HHK, MLC, JIM), pp. 26–30.
MSR-2005-NeamtiuFH #abstract syntax tree #comprehension #evolution #syntax #using: Understanding source code evolution using abstract syntax tree matching (IN, JSF, MWH), pp. 81–85.
MSR-2005-YingWA #eclipse #mining #repository: Source code that talks: an exploration of Eclipse task comments and their implication to repository mining (ATTY, JLW, SA), pp. 91–95.
PASTE-2005-BarnettL: Weakest-precondition of unstructured programs (MB, KRML), pp. 82–87.
PASTE-2005-LiangPH #algorithm #context-sensitive grammar #java: Evaluating the impact of context-sensitivity on Andersen’s algorithm for Java programs (DL, MP, MJH), pp. 6–12.
SCAM-2005-BermudoKH #assembly #control flow #graph #re-engineering: Control Flow Graph Reconstruction for Assembly Language Programs with Delayed Instructions (NB, AK, RNH), pp. 107–118.
SCAM-2005-PowerH #classification #java #named: Declassification: Transforming Java Programs to Remove Intermediate Classes (BP, GWH), pp. 183–192.
SCAM-2005-SzegediG #bytecode #java #slicing: Dynamic Slicing of Java Bytecode Programs (AS, TG), pp. 35–44.
CIAA-2005-PodlovchenkoRZ #equivalence #on the #problem: On the Equivalence Problem for Programs with Mode Switching (RIP, DMR, VAZ), pp. 351–352.
FM-2005-AndronickCP #embedded #security #smarttech #verification: Formal Verification of Security Properties of Smart Card Embedded Source Code (JA, BC, CPM), pp. 302–317.
FM-2005-CelikuM #composition #cost analysis #probability #specification: Compositional Specification and Analysis of Cost-Based Properties in Probabilistic Programs (OC, AM), pp. 107–122.
SEFM-2005-HubertM #algorithm #c #case study #verification: A case study of C source code verification: the Schorr-Waite algorithm (TH, CM), pp. 190–199.
SEFM-2005-OlssonW #correctness #imperative #induction #proving: Customised Induction Rules for Proving Correctness of Imperative Programs (OO, AW), pp. 180–189.
CEFP-2005-TejfelHK: Temporal Properties of Clean Programs Proven in Sparkle-T (MT, ZH, TK), pp. 168–190.
Haskell-2005-AbelBBHN #haskell #type system #using #verification: Verifying haskell programs using constructive type theory (AA0, MB, AB, JH, UN), pp. 62–73.
ICFP-2005-RamosSV #partial evaluation #performance: Fast narrowing-driven partial evaluation for inductively sequential programs (JGR, JS, GV), pp. 228–239.
IFL-2005-GrelckSS #analysis #array: A Binding Scope Analysis for Generic Programs on Arrays (CG, SBS, AVS), pp. 212–230.
SOFTVIS-2005-CoxGR #data flow #parallel #visual notation: Adding parallelism to visual data flow programs (PTC, SG, ARC), pp. 135–144.
SOFTVIS-2005-DeLineKCR #comprehension #towards: Towards understanding programs through wear-based filtering (RD, AK, MC, GGR), pp. 183–192.
SOFTVIS-2005-MalloyP #c++ #modelling #uml #visualisation: Exploiting UML dynamic object modeling for the visualization of C++ programs (BAM, JFP), pp. 105–114.
VISSOFT-2005-SmithM #identification #interactive #java #runtime: Identifying Structural Features of Java Programs by Analysing the Interaction of Classes at Runtime (MPS, MM), pp. 108–113.
VISSOFT-2005-TeleaV #evolution #interactive #visual notation: Interactive Visual Mechanisms for Exploring Source Code Evolution (ACT, LV), pp. 52–57.
SEKE-2005-SouzaVSSGLH #message passing #named #parallel #testing: ValiPar: A Testing Tool for Message-Passing Parallel Programs (SdRSdS, SRV, PSLdS, AdSS, TBG, AdML, ACH), pp. 386–391.
SEKE-2005-XuXN #approach #aspect-oriented #testing: A State-Based Approach to Testing Aspect-Oriented Programs (DX, WX, KEN), pp. 366–371.
ECOOP-2005-RodriguezDFHLR #composition #concurrent #ml #multi #specification #thread #verification: Extending JML for Modular Specification and Verification of Multi-threaded Programs (ER, MBD, CF, JH, GTL, R), pp. 551–576.
QAPL-2004-AlpuenteGPV05 #model checking: Abstract Model Checking of tccp programs (MA, MdMG, EP, AV), pp. 19–36.
LOPSTR-2005-AlbertPG #logic programming #partial evaluation: Non-leftmost Unfolding in Partial Evaluation of Logic Programs with Impure Predicates (EA, GP, JPG), pp. 115–132.
LOPSTR-2005-AlvezL #algorithm #logic programming: An Algorithm for Local Variable Elimination in Normal Logic Programs (JÁ, PL), pp. 61–79.
LOPSTR-2005-CorreasPHB #analysis #composition: Experiments in Context-Sensitive Analysis of Modular Programs (JC, GP, MVH, FB), pp. 163–178.
LOPSTR-2005-OchoaPH #prolog: Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs (CO, GP, MVH), pp. 80–97.
LOPSTR-2005-PasarellaOPN #embedded #logic programming #semantics: A Transformational Semantics of Static Embedded Implications of Normal Logic Programs (EP, FO, EP, MN), pp. 133–146.
LOPSTR-2005-SuenagaKY #approach #automation #generative #type system: Extension of Type-Based Approach to Generation of Stream-Processing Programs by Automatic Insertion of Buffering Primitives (KS, NK, AY), pp. 98–114.
PLDI-2005-ElmasTQ #concurrent #detection #named #runtime #verification: VYRD: verifYing concurrent programs by runtime refinement-violation detection (TE, ST, SQ), pp. 27–37.
PLDI-2005-Solar-LezamaRBE #programming #sketching: Programming by sketching for bit-streaming programs (ASL, RMR, RB, KE), pp. 281–294.
PLDI-2005-XuBH #detection: A serializability violation detector for shared-memory server programs (MX, RB, MDH), pp. 1–14.
POPL-2005-NeubauerT #multi #program transformation: From sequential programs to multi-tier applications by program transformation (MN, PT), pp. 221–232.
SAS-2005-BruynoogheGH #analysis #logic programming #termination: Inference of Well-Typings for Logic Programs with Application to Termination Analysis (MB, JPG, WVH), pp. 35–51.
SAS-2005-ChinNQR #memory management #object-oriented #verification: Memory Usage Verification for OO Programs (WNC, HHN, SQ, MCR), pp. 70–86.
SAS-2005-RinetzkySY #analysis #interprocedural: Interprocedural Shape Analysis for Cutpoint-Free Programs (NR, MS, EY), pp. 284–302.
SAS-2005-SecciS #analysis #object-oriented: Pair-Sharing Analysis of Object-Oriented Programs (SS, FS), pp. 320–335.
SIGAda-2005-AlexandrID #ada #analysis #clustering #performance: Experimental performance analysis of ada programs in cluster system (KA, SI, KD), pp. 31–36.
ASE-2005-Grov #algorithm #approach #correctness #deduction #reasoning #verification: Verifying the correctness of hume programs: an approach combining deductive and algorithmic reasoning (GG), pp. 444–447.
ASE-2005-Tan #embedded #logic #modelling #self #specification: Model-based self-monitoring embedded programs with temporal logic specifications (LT), pp. 380–383.
ASE-2005-Zheng #testing: In regression testing selection when source code is not available (JZ0), pp. 452–455.
ESEC-FSE-2005-BasitJ #detection #similarity: Detecting higher-level similarity patterns in programs (HAB, SJ), pp. 156–165.
ESEC-FSE-2005-VeanesCST #online #testing: Online testing with model programs (MV, CC, WS, NT), pp. 273–282.
ICSE-2005-AtleeLLST #guidelines #re-engineering: Software engineering 2004: ACM/IEEE-CS guidelines for undergraduate programs in software engineering (JMA, RJL, TCL, AEKS, JBT), pp. 623–624.
ICSE-2005-HolmesM #recommendation #using: Using structural context to recommend source code examples (RH, GCM), pp. 117–125.
ICSE-2005-RenRST #impact analysis #java #named: Chianti: a change impact analysis tool for java programs (XR, BGR, MS, FT), pp. 664–665.
SAC-2005-GuoJ #logic programming: Mode-directed preferences for logic programs (HFG, BJ), pp. 1414–1418.
SAC-2005-WongQC #risk management: Source code-based software risk assessing (WEW, YQ, KMLC), pp. 1485–1490.
GPCE-2005-BravenboerVVV #ambiguity #metaprogramming #syntax #type system: Generalized Type-Based Disambiguation of Meta Programs with Concrete Object Syntax (MB, RV, JJV, EV), pp. 157–172.
GPCE-2005-WuL #programming #reasoning #using: Shadow Programming: Reasoning About Programs Using Lexical Join Point Information (PW, KJL), pp. 141–156.
CASE-2005-AbdelhameedD #debugging #logic #network #programmable: Diagnosis and debugging of programmable logic controller control programs by neural networks (MMA, HD), pp. 313–318.
CC-2005-ShashidharBCJ #equivalence #program transformation #verification: Verification of Source Code Transformations by Program Equivalence Checking (KCS, MB, FC, GJ), pp. 221–236.
CC-2005-XueN #analysis #object-oriented: Completeness Analysis for Incomplete Object-Oriented Programs (JX, PHN), pp. 271–286.
DAC-2005-KaruriFKLAM #design #fine-grained #profiling: Fine-grained application source code profiling for ASIP design (KK, MAAF, SK, RL, GA, HM), pp. 329–334.
DATE-2005-ShashidharBCJ #algebra #equivalence #functional #verification: Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code (KCS, MB, FC, GJ), pp. 1310–1315.
LCTES-2005-FrankeOTF #embedded #optimisation #probability: Probabilistic source-level optimisation of embedded programs (BF, MFPO, JT, GF), pp. 78–86.
LCTES-2005-SermulinsTRA #optimisation: Cache aware optimization of stream programs (JS, WT, RMR, SPA), pp. 115–126.
PDP-2005-DortaRSG #repository: The OpenMP Source Code Repository (AJD, CR, FdS, AGE), pp. 244–250.
PPoPP-2005-FreehL #clustering #energy #multi #using: Using multiple energy gears in MPI programs on a power-scalable cluster (VWF, DKL), pp. 164–173.
PPoPP-2005-LiHDH #automation #c #multi #thread: Automatic multithreading and multiprocessing of C programs for IXP (LL, BH, JD, LH), pp. 132–141.
PPoPP-2005-SiegelA #modelling #verification: Modeling wildcard-free MPI programs for verification (SFS, GSA), pp. 95–106.
PPoPP-2005-SuraFWMLP #compilation #consistency #java #performance: Compiler techniques for high performance sequentially consistent java programs (ZS, XF, CLW, SPM, JL, DAP), pp. 2–13.
PPoPP-2005-ThiesKSRA #distributed: Teleport messaging for distributed stream programs (WT, MK, JS, RMR, SPA), pp. 224–235.
PPoPP-2005-WangS #static analysis: Static analysis of atomicity for programs with non-blocking synchronization (LW, SDS), pp. 61–71.
PPoPP-2005-YangBHM #correctness #monitoring #trust #verification: Trust but verify: monitoring remotely executing programs for progress and correctness (SY, ARB, YCH, SPM), pp. 196–205.
ESOP-2005-LeeYY #analysis #automation #grammarware #pointer #using #verification: Automatic Verification of Pointer Programs Using Grammar-Based Shape Analysis (OL, HY, KY), pp. 124–140.
ESOP-2005-LuK #logic programming: Determinacy Inference for Logic Programs (LL, AK), pp. 108–123.
ESOP-2005-PodelskiSW #recursion #summary: Summaries for While Programs with Recursion (AP, IS, SW), pp. 94–107.
ESOP-2005-Thiemann #javascript #towards #type system: Towards a Type System for Analyzing JavaScript Programs (PT), pp. 408–422.
FASE-2005-JakobacEM #analysis #comprehension #interactive: Improving System Understanding via Interactive, Tailorable, Source Code Analysis (VJ, AE, NM), pp. 253–268.
FASE-2005-LarsenLW #specification: Color-Blind Specifications for Transformations of Reactive Synchronous Programs (KGL, UL, AW), pp. 160–174.
TACAS-2005-BouajjaniHMV #model checking #verification: Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking (AB, PH, PM, TV), pp. 13–29.
TACAS-2005-KellerSBS #c #debugging #model checking #named: FocusCheck: A Tool for Model Checking and Debugging Sequential C Programs (CWK, DS, SB, SAS), pp. 563–569.
CAV-2005-CostanGGMP #algorithm #fixpoint #policy #static analysis: A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs (AC, SG, EG, MM, SP), pp. 462–475.
CAV-2005-RabinovitzG #bound #concurrent #model checking: Bounded Model Checking of Concurrent Programs (IR, OG), pp. 82–97.
CAV-2005-VecchieS: Syntax-Driven Reachable State Space Construction of Synchronous Reactive Programs (EV, RdS), pp. 213–225.
CSL-2005-CharatonikGM #bound #model checking #pointer: Bounded Model Checking of Pointer Programs (WC, LG, PM), pp. 397–412.
ICLP-2005-BrasselH #analysis #functional #logic programming #nondeterminism: Nondeterminism Analysis of Functional Logic Programs (BB, MH), pp. 265–279.
ICLP-2005-DuanYK #logic programming #semantics: Semantics of Framed Temporal Logic Programs (ZD, XY, MK), pp. 356–370.
ICLP-2005-NguyenS #analysis #logic programming #polynomial #termination: Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs (MTN, DDS), pp. 311–325.
ICLP-2005-PueblaAH #analysis #framework #logic programming: A Generic Framework for the Analysis and Specialization of Logic Programs (GP, EA, MVH), pp. 407–409.
ICLP-2005-RochaSC #evaluation #logic programming: Dynamic Mixed-Strategy Evaluation of Tabled Logic Programs (RR, FMAS, VSC), pp. 250–264.
ICLP-2005-SaadP #hybrid #logic programming #probability: Hybrid Probabilistic Logic Programs with Non-monotonic Negation (ES, EP), pp. 204–220.
ICLP-2005-Schindlauer #logic programming #semantics #web: Nonmonotonic Logic Programs for the Semantic Web (RS), pp. 446–447.
ICLP-2005-Sneyers #analysis #optimisation: Analysis and Optimization of CHR Programs (JS), pp. 450–451.
VMCAI-2005-AttieC #concurrent #scalability: Efficiently Verifiable Conditions for Deadlock-Freedom of Large Concurrent Programs (PCA, HC), pp. 465–481.
VMCAI-2005-Bertrane #abstract interpretation #composition #static analysis: Static Analysis by Abstract Interpretation of the Quasi-synchronous Composition of Synchronous Programs (JB), pp. 97–112.
VMCAI-2005-BradleyMS #polynomial #termination: Termination of Polynomial Programs (ARB, ZM, HBS), pp. 113–129.
VMCAI-2005-Martel #overview #semantics #validation: An Overview of Semantics for the Validation of Numerical Programs (MM), pp. 59–77.
VMCAI-2005-SalcianuR #analysis #java: Purity and Side Effect Analysis for Java Programs (AS, MCR), pp. 199–215.
VMCAI-2005-Siegel #performance #verification: Efficient Verification of Halting Properties for MPI Programs with Wildcard Receives (SFS), pp. 413–429.
WICSA-2004-BernardoB #architecture #generative #parallel #thread: Generating Well-Synchronized Multithreaded Programs from Software Architecture Descriptions (MB, EB), pp. 167–176.
CSEET-2004-LeBlancLS #education #generative #re-engineering #using: Generating Undergraduate Software Engineering Courses/Programs Using the Computing Curricula Software Engineering Volume (RJL, TCL, AEKS), pp. 167–168.
CSEET-2004-SeidmanF #re-engineering #risk management: Software Offshoring ?^(a) Risks and Opportunities for Software Engineering Programs (SBS, LF), p. 153.
ITiCSE-2004-ConradF #object-oriented #paradigm #using: Using the synergies between the object-oriented paradigm and mathematics in joint mathematics/computer science programs (MC, TF), p. 254.
ITiCSE-2004-English #assessment #automation #user interface #using: Automated assessment of GUI programs using JEWL (JE), pp. 137–141.
SIGITE-2004-EckerCHM #implementation: Implementing an interdisciplinary capstone course for associate degree information technology programs (PSE, JC, DH, CM), pp. 60–65.
SIGITE-2004-PriceR #question #student: Technology-based degrees: do faculty and students agree on necessary skills for success in these programs? (BP, CHR), pp. 235–240.
CSMR-2004-Al-EkramK #composition #concept #slicing #using: Source Code Modularization Using Lattice of Concept Slices (RAE, KK), pp. 195–203.
CSMR-2004-Martin #automation #generative #program transformation: Automated Source Code Transformations on Fourth Generation Languages (JM), pp. 214–222.
ICSM-2004-Krinke04a #concurrent #slicing: Advanced Slicing of Sequential and Concurrent Programs (JK), pp. 464–468.
ICSM-2004-MaleticC #analysis #difference: Supporting Source Code Difference Analysis (JIM, MLC), pp. 210–219.
ICSM-2004-PinzgerFJG: Abstracting Module Views from Source Code (MP, MF, MJ, HG), p. 533.
ICSM-2004-TahvildariK #approach #multi: Developing a Multi-Objective Decision Approach to Select Source-Code Improving Transformations (LT, KK), pp. 427–431.
ICSM-2004-TeohW #tool support: Tools for Extracting Software Structure from Compiled Programs (HST, DBW), p. 526.
IWPC-2004-KanellopoulosT #c++ #clustering #comprehension #data mining #mining: Data Mining Source Code to Facilitate Program Comprehension: Experiments on Clustering Data Retrieved from C++ Programs (YK, CT), pp. 214–225.
IWPC-2004-Kelsen #behaviour #comprehension: A Simple Static Model for Understanding the Dynamic Behavior of Programs (PK), pp. 46–51.
IWPC-2004-MohanG #evolution #programming: Programming Style Changes in Evolving Source Code (AM, NG), pp. 236–240.
PASTE-2004-Martel #assembly #validation: Validation of assembler programs for DSPs: a static analyzer (MM), pp. 8–13.
SCAM-2004-MaruyamaY #automation #framework #java #platform #representation #using #xml: A CASE Tool Platform Using an XML Representation of Java Source Code (KM, SY), pp. 158–167.
SCAM-2004-RoblesG #analysis #execution: Executable Source Code and Non-Executable Source Code: Analysis and Relationships (GR, JMGB), pp. 149–157.
SCAM-2004-Rothermel #analysis #using: Using Source-Code Analysis to Help End-User Programmers Create Dependable Software (GR), p. 3.
SCAM-2004-WahlerSGF #clone detection #detection: Clone Detection in Source Code by Frequent Itemset Techniques (VW, DS, JWvG, GF), pp. 128–135.
WCRE-2004-Harrold #analysis #control flow: Static and Dynamic Analyses of Programs with Implicit Control Flow (MJH), p. 5.
WCRE-2004-KarailaS #analysis #case study #industrial #maintenance #visual notation: Maintenance and Analysis of Visual Programs — An Industrial Case (MK, TS), pp. 294–295.
WCRE-2004-MarcusSRM #approach #concept #information retrieval: An Information Retrieval Approach to Concept Location in Source Code (AM, AS, VR, JIM), pp. 214–223.
CIAA-2004-ZakharovZ #automaton #multi #on the #problem: On the Equivalence-Checking Problem for a Model of Programs Related with Multi-tape Automata (VAZ, IZ), pp. 293–305.
ICALP-2004-Skelley #quantifier #reasoning: Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas (AS), pp. 1163–1175.
RTA-2004-LimetS #logic programming #proving #term rewriting: Proving Properties of Term Rewrite Systems via Logic Programs (SL, GS), pp. 170–184.
AFP-2004-Thompson04 #functional #refactoring: Refactoring Functional Programs (SJT), pp. 331–357.
FLOPS-2004-GluckK #lr #parsing: Derivation of Deterministic Inverse Programs Based on LR Parsing (RG, MK), pp. 291–306.
FLOPS-2004-PemmasaniGDRR #logic programming #online: Online Justification for Tabled Logic Programs (GP, HFG, YD, CRR, IVR), pp. 24–38.
ICFP-2004-ChristiansenH #concurrent #debugging #haskell: Searching for deadlocks while debugging concurrent haskell programs (JC, FH), pp. 28–39.
IFL-2004-Cristobal-SalasCRG #message passing #program transformation: Exploiting Single-Assignment Properties to Optimize Message-Passing Programs by Code Transformations (ACS, AC, ERA, JLG), pp. 1–16.
IFL-2004-StefanovS #effectiveness #functional #reduction: Simple, Effective Code-Size Reduction for Functional Programs (ES, AMS), pp. 211–225.
ICGT-2004-PlumpS #algorithm #graph #towards: Towards Graph Programs for Graph Algorithms (DP, SS), pp. 128–143.
CAiSE-2004-MorishimaK #database #optimisation #relational #xml: Optimizing DOM Programs on XML Views over Existing Relational Databases (AM, AK), pp. 248–262.
ICEIS-v1-2004-Lyytinen #analysis #functional #requirements #scalability: Large Scale Requirements Engineering in Action: An Ethnographic Analysis of Functional and Political Ecologies in Situ in Space Mission Programs (KL), p. V.
KR-2004-HustadtMS #datalog #logic: Reducing SHIQ-Description Logic to Disjunctive Datalog Programs (UH, BM, US), pp. 152–162.
SEKE-2004-JaufmanFR #metric #quality #reuse: Reusing Knowledge on Software Quality for Developing Measurement Programs (OJ, BGF, IR), pp. 264–269.
OOPSLA-2004-DonovanKTE #java #library: Converting java programs to use generic libraries (AD, AK, MST, MDE), pp. 15–34.
OOPSLA-2004-DufourGHMSV #aspectj #behaviour: Measuring the dynamic behaviour of AspectJ programs (BD, CG, LJH, OdM, GS, CV), pp. 150–169.
OOPSLA-2004-RenSTRC #impact analysis #java #named: Chianti: a tool for change impact analysis of java programs (XR, FS, FT, BGR, OCC), pp. 432–448.
AdaEurope-2004-BurgstallerBS #ada #on the: On the Tree Width of Ada Programs (BB, JB, BS), pp. 78–90.
AdaEurope-2004-Sward #ada #legacy: Extracting Ada 95 Objects from Legacy Ada Programs (RES), pp. 65–77.
LOPSTR-2004-BrasselHHSV #functional #logic programming #profiling #runtime: Run-Time Profiling of Functional Logic Programs (BB, MH, FH, JS, GV), pp. 182–197.
LOPSTR-2004-Colon #constraints #imperative #synthesis #theorem proving: Schema-Guided Synthesis of Imperative Programs by Constraint Solving (MC), pp. 166–181.
LOPSTR-2004-KulkarniBE #automation #fault tolerance #synthesis #verification: Mechanical Verification of Automatic Synthesis of Fault-Tolerant Programs (SSK, BB, AE), pp. 36–52.
LOPSTR-2004-Lopez-GarciaBH #analysis #logic programming #using: Determinacy Analysis for Logic Programs Using Mode and Type Information (PLG, FB, MVH), pp. 19–35.
LOPSTR-2004-Rao #logic programming: Input-Termination of Logic Programs (MRKKR), pp. 215–230.
LOPSTR-2004-SerebrenikM #on the #termination: On Termination of Binary CLP Programs (AS, FM), pp. 231–244.
LOPSTR-2004-Vanhoof #logic programming #semantics: Searching Semantically Equivalent Code Fragments in Logic Programs (WV), pp. 1–18.
PADL-2004-ElkhatibPS #named #prolog #reasoning #set: ASP-PROLOG: A System for Reasoning about Answer Set Programs in Prolog (OEK, EP, TCS), pp. 148–162.
PDCL-2004-BasinDFHN #logic #synthesis: Synthesis of Programs in Computational Logic (DAB, YD, PF, AH, JFN), pp. 30–65.
PDCL-2004-BossiCER #declarative #logic programming #semantics: Declarative Semantics of Input Consuming Logic Programs (AB, NC, SE, SR), pp. 90–114.
PDCL-2004-ColvinGHHNS #logic programming #refinement #specification #using: Developing Logic Programs from Specifications Using Stepwise Refinement (RC, LG, IJH, DH, RN, PAS), pp. 66–89.
PDCL-2004-FioravantiPP #constraints #logic programming: Transformation Rules for Locally Stratified Constraint Logic Programs (FF, AP, MP), pp. 291–339.
PDCL-2004-HoweKL #logic programming #reasoning: Analysing Logic Programs by Reasoning Backwards (JMH, AK, LL), pp. 152–188.
PDCL-2004-LindenstraussSS #approach #logic programming #proving #termination: Proving Termination for Logic Programs by the Query-Mapping Pairs Approach (NL, YS, AS), pp. 453–498.
PDCL-2004-PueblaCHBBMS #analysis #composition #framework: A Generic Framework for Context-Sensitive Analysis of Modular Programs (GP, JC, MVH, FB, MJGdlB, KM, PJS), pp. 233–260.
PEPM-2004-DuranLMMU #equation #proving #termination: Proving termination of membership equational programs (FD, SL, JM, CM, XU), pp. 147–158.
PLDI-2004-Appel #process #proving #revisited #social #theorem: Social processes and proofs of theorems and programs, revisited (AWA), p. 170.
PLDI-2004-DuLLYZN #compilation #framework #parallel: A cost-driven compilation framework for speculative parallelization of sequential programs (ZHD, CCL, XFL, CY, QZ, TFN), pp. 71–81.
PLDI-2004-VenetB #array #bound #c #embedded #performance #precise #scalability: Precise and efficient static array bound checking for large embedded C programs (AV, GPB), pp. 231–242.
POPL-2004-FlanaganF #named #parallel #thread: Atomizer: a dynamic atomicity checker for multithreaded programs (CF, SNF), pp. 256–267.
POPL-2004-QadeerRR #concurrent: Summarizing procedures in concurrent programs (SQ, SKR, JR), pp. 245–255.
PPDP-2004-BrasselHHV #declarative #multi #semantics: A semantics for tracing declarative multi-paradigm programs (BB, MH, FH, GV), pp. 179–190.
PPDP-2004-ClevaLL #approach #functional #logic programming #verification: A logic programming approach to the verification of functional-logic programs (JMC, JL, FJLF), pp. 9–19.
SAS-2004-Colon #algebra #approximate #imperative #relational #semantics: Approximating the Algebraic Relational Semantics of Imperative Programs (MC), pp. 296–311.
SAS-2004-PayetM #constraints #logic programming: Non-termination Inference for Constraint Logic Programs (ÉP, FM), pp. 377–392.
SAS-2004-Venet #analysis #embedded #pointer #scalability: A Scalable Nonuniform Pointer Analysis for Embedded Programs (AV), pp. 149–164.
ASE-2004-ApiwattanapongOH #algorithm #difference #object-oriented: A Differencing Algorithm for Object-Oriented Programs (TA, AO, MJH), pp. 2–13.
ASE-2004-Capuano #interactive #visualisation: Interactive Visualization of Concurrents Programs (RC), pp. 418–421.
ASE-2004-LeowKLS #automation #generative #heuristic #reachability #testing: Heuristic Search with Reachability Tests for Automated Generation of Test Programs (WKL, SCK, THL, VS), pp. 282–285.
ASE-2004-LicataK #interactive #verification #web: Verifying Interactive Web Programs (DRL, SK), pp. 164–173.
FSE-2004-DingelL #analysis #automation #concurrent #safety #txl #using: Automating comprehensive safety analysis of concurrent programs using verisoft and TXL (JD, HL), pp. 13–22.
FSE-2004-RinardSB #analysis #aspect-oriented #classification: A classification system and analysis for aspect-oriented programs (MCR, AS, SB), pp. 147–158.
FSE-2004-XuDS #c #memory management #performance #safety: An efficient and backwards-compatible transformation to ensure memory safety of C programs (WX, DCD, RS), pp. 117–126.
FSE-2004-ZitserLL #open source #static analysis #testing #tool support #using: Testing static analysis tools using exploitable buffer overflows from open source code (MZ, RL, TL), pp. 97–106.
ICSE-2004-AntoniuSKNF #correctness #spreadsheet #validation: Validating the Unit Correctness of Spreadsheet Programs (TA, PAS, SK, EN, MF), pp. 439–448.
ICSE-2004-GiannakopoulouPC #verification: Assume-Guarantee Verification of Source Code with Design-Level Assumptions (DG, CSP, JMC), pp. 211–220.
ICSE-2004-LeowKS #automation #generative #specification #testing: Automated Generation of Test Programs from Closed Specifications of Classes and Test Cases (WKL, SCK, YS), pp. 96–105.
ICSE-2004-WangR #bytecode #java #slicing #using: Using Compressed Bytecode Traces for Slicing Java Programs (TW, AR), pp. 512–521.
SAC-2004-AgostaPS #architecture #design #embedded #multi #power management #program transformation: Multi-objective co-exploration of source code transformations and design space architectures for low-power embedded systems (GA, GP, CS), pp. 891–896.
SAC-2004-RamirezS #concurrent #constraints #distributed #logic programming #using: Concurrent and distributed programming using constraint logic programs (RR, AES), pp. 508–509.
ATEM-2003-CoxC04 #modelling: Three-Layered Source-Code Modelling (AC, CLAC), pp. 71–79.
ATEM-2003-KnodelC04 #delphi #fact extraction #metamodelling: A Meta-Model for Fact Extraction from Delphi Source Code (JK, GCM), pp. 19–28.
GPCE-2004-McDirmidH #aspect-oriented #named: Splice: Aspects That Analyze Programs (SM, WCH), pp. 19–38.
GPCE-2004-ZookHS #aspectj #generative: Generating AspectJ Programs with Meta-AspectJ (DZ, SSH, YS), pp. 1–18.
LDTA-2004-GradaraSVV #model checking #modelling #parallel #thread: Model Checking Multithreaded Programs by Means of Reduced Models (SG, AS, MLV, GV), pp. 55–74.
ASPLOS-2004-BronevetskyMPSS #memory management: Application-level checkpointing for shared memory programs (GB, DM, KP, PKS, MS), pp. 235–247.
CC-2004-RanganathH #concurrent #dependence #java #slicing: Pruning Interference and Ready Dependence for Slicing Concurrent Java Programs (VPR, JH), pp. 39–56.
DAC-2004-SchueleS #abstraction #analysis #assembly #execution: Abstraction of assembler programs for symbolic worst case execution time analysis (TS, KS), pp. 107–112.
DATE-DF-2004-BrandoleseFSS #analysis #energy #modelling #program transformation: Analysis and Modeling of Energy Reducing Source Code Transformations (CB, WF, FS, DS), pp. 306–311.
DATE-v2-2004-RizkPW #design #embedded: Designing Self Test Programs for Embedded DSP Cores (HR, CAP, FGW), pp. 816–823.
ISMM-2004-CheremR #analysis #java: Region analysis and transformation for Java programs (SC, RR), pp. 85–96.
ISMM-2004-LeeY #automation #effectiveness #memory management: Experiments on the effectiveness of an automatic insertion of memory reuses into ML-like programs (OL, KY), pp. 97–107.
PDP-2004-AsenjoCGNPZ #optimisation #pointer: Optimization Techniques for Irregular and Pointer-Based Programs (RA, FC, EG, MAN, OGP, ELZ), p. 2–?.
PDP-2004-MaciasSS #detection #monitoring #performance: Efficient Monitoring to Detect Wireless Channel Failures for MPI Programs (EMM, ÁS, VSS), pp. 374–381.
ESOP-2004-FilliatreL #proving: Functors for Proofs and Programs (JCF, PL), pp. 370–384.
ESOP-2004-JiaW #distributed #proving: Modal Proofs as Distributed Programs (LJ, DW), pp. 219–233.
STOC-2004-DunaganV #algorithm #linear #polynomial: A simple polynomial-time rescaling algorithm for solving linear programs (JD, SV), pp. 315–320.
TACAS-2004-ClarkeKL: A Tool for Checking ANSI-C Programs (EMC, DK, FL), pp. 168–176.
TACAS-2004-SenRA #analysis #online #parallel #performance #predict #safety #thread: Online Efficient Predictive Safety Analysis of Multithreaded Programs (KS, GR, GA), pp. 123–138.
CAV-2004-FarzanCMR #analysis #formal method #java: Formal Analysis of Java Programs in JavaFAN (AF, FC, JM, GR), pp. 501–505.
CAV-2004-Tiwari #linear #termination: Termination of Linear Programs (AT), pp. 70–82.
ICLP-2004-Barker #logic programming: Labeled Logic Programs (SB), pp. 448–449.
ICLP-2004-CumboFGL #datalog: Enhancing the Magic-Set Method for Disjunctive Datalog Programs (CC, WF, GG, NL), pp. 371–385.
ICLP-2004-DekhtyarD #logic programming #probability #semantics: Possible Worlds Semantics for Probabilistic Logic Programs (AD, MID), pp. 137–148.
ICLP-2004-JiaYY #set: Adding Domain Dependent Knowledge into Answer Set Programs for Planning (XJ, JHY, LYY), pp. 400–415.
ICLP-2004-LinkeTW #logic programming #on the: On Acyclic and Head-Cycle Free Nested Logic Programs (TL, HT, SW), pp. 225–239.
ICLP-2004-NieuwenborghHV #multi #on the #order: On Programs with Linearly Ordered Multiple Preferences (DVN, SH, DV), pp. 180–194.
ICLP-2004-Pearce #logic programming #semantics #set: Simplifying Logic Programs Under Answer Set Semantics (DP), pp. 210–224.
ICLP-2004-RamirezM #constraints #distributed #java #verification: Constraint-Based Synchronization and Verification of Distributed Java Programs (RR, JM), pp. 473–474.
ICLP-2004-RochaSC #logic programming: Speculative Computations in Or-Parallel Tabled Logic Programs (RR, FMAS, VSC), pp. 254–268.
ICLP-2004-SchrijversS #prolog #refactoring: Improving Prolog Programs: Refactoring for Prolog (TS, AS), pp. 58–72.
ICLP-2004-Smaus #logic programming #termination #using: Termination of Logic Programs Using Various Dynamic Selection Rules (JGS), pp. 43–57.
ICLP-2004-VennekensVB #logic programming: Logic Programs with Annotated Disjunctions (JV, SV, MB), pp. 431–445.
IJCAR-2004-LutzW: PDL with Negation of Atomic Programs (CL, DW), pp. 259–273.
IJCAR-2004-Subramani #integer #quantifier: Analyzing Selected Quantified Integer Programs (KS), pp. 342–356.
VMCAI-2004-XiaH #c: Certifying Temporal Properties for Compiled C Programs (SX, JH), pp. 161–174.
ITiCSE-2003-BarkerG #women: The effect of institutional characteristics on participation of women in computer science bachelors degree programs (LJB, KGD), p. 242.
ITiCSE-2003-TaylorP: Putting ITiCSE into practice through NSF funding programs (HGT, JCP), p. 234.
ICSM-2003-BalanyiF #c++ #design pattern #mining: Mining Design Patterns from C++ Source Code (ZB, RF), pp. 305–314.
ICSM-2003-GoldM #comprehension #concept #evolution #framework: A Framework for Understanding Conceptual Changes in Evolving Source Code (NG, AM), pp. 431–439.
ICSM-2003-Klusener #analysis: Source Code Based Function Point Analysis for Enhancement Projects (SK), pp. 373–376.
ICSM-2003-MensPG #maintenance #using: Using Intentional Source-Code Views to Aid Software Maintenance (KM, BP, SG), pp. 169–178.
IWPC-2003-BeyerL #analysis #named #object-oriented #performance: CrocoPat: Efficient Pattern Analysis in Object-Oriented Programs (DB, CL), pp. 294–295.
IWPC-2003-Cordy #agile #semiparsing #using #xml: Generalized Selective XML Markup of Source Code Using Agile Parsing (JRC), pp. 144–153.
IWPC-2003-TjortjisSL #comprehension #mining: Facilitating Program Comprehension by Mining Association Rules from Source Code (CT, LS, PJL), pp. 125–133.
SCAM-2003-BaggeKHV #c++ #design #optimisation: Design of the CodeBoost Transformation System for Domain-Specific Optimisation of C++ Programs (OSB, KTK, MH, EV), p. 65–?.
SCAM-2003-BinkleyH #algorithm #analysis #graph #optimisation #performance #reachability #scalability: Results from a Large-Scale Study of Performance Optimization Techniques for Source Code Analyses Based on Graph Reachability Algorithms (DB, MH), p. 203–?.
SCAM-2003-KulkarniR #slicing: Static Slicing of Reactive Programs (ARK, SR), pp. 98–107.
SCAM-2003-Verhoef #analysis #multi #using: Managing Multi-Billion Dollar IT Budgets using Source Code Analysis (CV), p. 77–?.
WCRE-2003-BaumstarkGW #representation: Extracting an Explicitly Data-Parallel Representation of Image-Processing Programs (LBBJ, MG, LMW), pp. 24–35.
WCRE-2003-Clermont #scalability #spreadsheet: Analyzing Large Spreadsheet Programs (MC), pp. 306–315.
WCRE-2003-DahnM #c #program transformation #using: Using Program Transformation to Secure C Programs Against Buffer Overflows (CD, SM), pp. 323–333.
FME-2003-BertBPRV #adaptation #c #embedded #specification: Adaptable Translator of B Specifications to Embedded C Programs (DB, SB, MLP, AR, LV), pp. 94–113.
SEFM-2003-WatsonF #assembly #modelling #semantics: A Partial-Correctness Semantics for Modelling Assembler Programs (GW, CJF), pp. 82–90.
TLCA-2003-Kahrs: Well-Going Programs Can Be Typed (SK), pp. 167–179.
Haskell-2003-EnnalsJ #debugging #lazy evaluation #named: HsDebug: debugging lazy programs by not being lazy (RE, SLPJ), pp. 84–87.
Haskell-2003-LiRT #functional #refactoring #tool support: Tool support for refactoring functional programs (HL, CR, SJT), pp. 27–38.
ICFP-2003-EnnalsJ #adaptation #evaluation #strict: Optimistic evaluation: an adaptive evaluation strategy for non-strict programs (RE, SLPJ), pp. 287–298.
IFL-2003-VasconcelosH #equation #functional #higher-order #polymorphism #recursion: Inferring Cost Equations for Recursive, Polymorphic and Higher-Order Functional Programs (PBV, KH), pp. 86–101.
VISSOFT-2003-DavisPK #3d #named #object-oriented #visualisation: KScope: A Modularized Tool for 3D Visualization of Object-Oriented Programs (TAD, KP, AK), pp. 98–103.
ICEIS-v1-2003-Al-Fawareh #approach #comprehension #dependence #named #object-oriented: O2PDGS: An Approach for Understanding Object Oriented Programs (HJAF), pp. 450–455.
ICEIS-v3-2003-LiongM #dependence #design: Computing Message Dependencies in System Designs and Programs (BLL, LAM), pp. 619–622.
CIKM-2003-YeeN #data access #multi #performance: Efficient data access to multi-channel broadcast programs (WGY, SBN), pp. 153–160.
ICML-2003-BerardiCEM #analysis #layout #learning #logic programming: Learning Logic Programs for Layout Analysis Correction (MB, MC, FE, DM), pp. 27–34.
KDD-2003-SequeiraZSC #data mining #locality #mining: Improving spatial locality of programs via data mining (KS, MJZ, BKS, CDC), pp. 649–654.
SEKE-2003-ChenXCYZ #scalability #slicing: Partial Slicing for Large Programs (ZC, BX, WCC, HY, JZ), pp. 204–207.
SIGIR-2003-KrovetzUG #classification: Classification of source code archives (RK, SU, CLG), pp. 425–426.
ECOOP-2003-JagadeesanJR #aspect-oriented #calculus: A Calculus of Untyped Aspect-Oriented Programs (RJ, AJ, JR), pp. 54–73.
OOPSLA-2003-EeckhoutGB #architecture #how #java #virtual machine: How java programs interact with virtual machines at the microarchitectural level (LE, AG, KDB), pp. 169–186.
AdaEurope-2003-EvangelistaKPR #ada #analysis #concurrent #named: Quasar: A New Tool for Concurrent Ada Programs Analysis (SE, CK, JFPP, PR), pp. 168–181.
LOPSTR-2003-Gallagher #analysis #logic programming #program transformation: A Program Transformation for Backwards Analysis of Logic Programs (JPG), pp. 92–105.
PADL-2003-BarceloB #consistency #database #logic programming #query: Logic Programs for Querying Inconsistent Databases (PB, LEB), pp. 208–222.
PADL-2003-HillS #logic programming: Logic Programs as Compact Denotations (PMH, FS), pp. 339–356.
PEPM-2003-AllenH #exception #java #slicing: Slicing java programs that throw and catch exceptions (MA, SH), pp. 44–54.
PLDI-2003-LambTA #analysis #linear #optimisation: Linear analysis and optimization of stream programs (AAL, WT, SPA), pp. 12–25.
PLDI-2003-PraunG #analysis #concurrent #multi #object-oriented #thread: Static conflict analysis for multi-threaded object-oriented programs (CvP, TRG), pp. 115–128.
POPL-2003-BouajjaniET #approach #concurrent #static analysis: A generic approach to the static analysis of concurrent programs with procedures (AB, JE, TT), pp. 62–73.
POPL-2003-HofmannJ #first-order #functional #predict: Static prediction of heap space usage for first-order functional programs (MH, SJ), pp. 185–197.
PPDP-2003-LiuS #datalog #performance: From datalog rules to efficient programs with time and space guarantees (YAL, SDS), pp. 172–183.
SAS-2003-ChatterjeeMMZHP #analysis #stack: Stack Size Analysis for Interrupt-Driven Programs (KC, DM, RM, TZ, TAH, JP), pp. 109–126.
SAS-2003-LeeYY #memory management #reuse: Inserting Safe Memory Reuse Commands into ML-Like Programs (OL, HY, KY), pp. 171–188.
SAS-2003-Monniaux #abstract interpretation #markov #process: Abstract Interpretation of Programs as Markov Decision Processes (DM), pp. 237–254.
SIGAda-2003-EvangelistaKPR #ada #concurrent #linear #logic #verification: Verifying linear time temporal logic properties of concurrent Ada programs with quasar (SE, CK, JFPP, PR), pp. 17–24.
ASE-2003-Collard #difference #framework #refactoring: An Infrastructure to Support Meta-Differencing and Refactoring of Source Code (MLC), pp. 377–380.
ASE-2003-LicataHK #evolution: The Feature Signatures of Evolving Programs (DRL, CDH, SK), pp. 281–285.
ASE-2003-MayerS #debugging #exception: Extending Diagnosis to Debug Programs with Exceptions (WM, MS), pp. 240–244.
ASE-2003-SmithS #automation #design pattern #flexibility #named: SPQR: Flexible Automated Design Pattern Extraction From Source Code (JMS, PDS), pp. 215–224.
ESEC-FSE-2003-Krinke #concurrent #slicing: Context-sensitive slicing of concurrent programs (JK), pp. 178–187.
ESEC-FSE-2003-LivshitsL #c #context-sensitive grammar #debugging #detection #pointer: Tracking pointers with path and context sensitivity for bug detection in C programs (VBL, MSL), pp. 317–326.
ESEC-FSE-2003-SenRA #analysis #parallel #runtime #safety #thread: Runtime safety analysis of multithreaded programs (KS, GR, GA), pp. 337–346.
ESEC-FSE-2003-YongH #c #pointer: Protecting C programs from attacks via invalid pointer dereferences (SHY, SH), pp. 307–316.
ICSE-2003-RobillardM: FEAT. A Tool for Locating, Describing, and Analyzing Concerns in Source Code (MPR, GCM), pp. 822–823.
SAC-2003-NandaR #analysis #java #parallel #pointer #thread: Pointer Analysis of Multithreaded Java Programs (MGN, SR), pp. 1068–1075.
CC-2003-BurrowsFW #runtime #type checking: Run-Time Type Checking for Binary Programs (MB, SNF, JLW), pp. 90–105.
CC-2003-MasuharaKD #aspect-oriented #compilation #optimisation: A Compilation and Optimization Model for Aspect-Oriented Programs (HM, GK, CD), pp. 46–60.
DAC-2003-ClarkeKY #behaviour #bound #c #consistency #model checking #using: Behavioral consistency of C and verilog programs using bounded model checking (EMC, DK, KY), pp. 368–371.
DATE-2003-CardosoW #c: From C Programs to the Configure-Execute Model (JMPC, MW), pp. 10576–10581.
DATE-2003-FalkM #control flow: Control Flow Driven Splitting of Loop Nests at the Source Code Level (HF, PM), pp. 10410–10415.
DATE-2003-LogothetisS #analysis: Exact High Level WCET Analysis of Synchronous Programs by Symbolic State Space Exploration (GL, KS), pp. 10196–10203.
DATE-2003-ZivkovicKWD #architecture #multi #performance: Fast and Accurate Multiprocessor Architecture Exploration with Symbolic Programs (VDZ, EAdK, PvdW, EFD), pp. 10656–10661.
LCTES-2003-AnanianR #java #optimisation: Data size optimizations for java programs (CSA, MCR), pp. 59–68.
LCTES-2003-KarczmarekTA #scheduling: Phased scheduling of stream programs (MK, WT, SPA), pp. 103–112.
PDP-2003-BorkowskiKT #implementation #parallel: Implementing Control in Parallel Programs by Synchronization-Driven Activation and Cancellation (JB, DK, MT), pp. 316–323.
PDP-2003-LeemanLFD #flexibility #library #parallel: A Flexible Library for Dependable Master-Worker Parallel Programs (ML, ML, VDF, GD), pp. 299–307.
PDP-2003-SeragiottoFGMM #automation #distributed #on the #parallel #performance #problem #using: On Using Aksum for Semi-Automatically Searching of Performance Problems in Parallel and Distributed Programs (CSJ, TF, MG, GM, HM), pp. 385–392.
PPoPP-2003-BronevetskyMPS #automation: Automated application-level checkpointing of MPI programs (GB, DM, KP, PS), pp. 84–94.
PPoPP-2003-PoznianskyS #c++ #concurrent #detection #multi #on the fly #performance: Efficient on-the-fly data race detection in multihreaded C++ programs (EP, AS), pp. 179–190.
ESOP-2003-AlpuenteBCF #functional #logic programming: Correction of Functional Logic Programs (MA, DB, FJC, MF), pp. 54–68.
ESOP-2003-GenaimK #analysis #independence #logic programming #scheduling: Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling (SG, AK), pp. 84–98.
CADE-2003-MehtaN #higher-order #logic #pointer #proving: Proving Pointer Programs in Higher-Order Logic (FM, TN), pp. 121–135.
CAV-2003-BordiniFPVW #model checking #multi: Model Checking Multi-Agent Programs with CASP (RHB, MF, CP, WV, MW), pp. 110–113.
CAV-2003-RosuVWL #estimation: Certifying Optimality of State Estimation Programs (GR, RPV, JW, LL), pp. 301–314.
CSL-2003-KristiansenV #power of #strict: The Surprising Power of Restricted Programs and Gödel’s Functionals (LK, PJV), pp. 345–358.
ICLP-2003-EiterF #equivalence #logic programming #semantics: Uniform Equivalence of Logic Programs under the Stable Model Semantics (TE, MF), pp. 224–238.
ICLP-2003-EiterFGL #evaluation #integration #logic programming #performance #query: Efficient Evaluation of Logic Programs for Querying Data Integration Systems (TE, MF, GG, DL), pp. 163–177.
ICLP-2003-KingL #logic programming #verification: Forward versus Backward Verification of Logic Programs (AK, LL), pp. 315–330.
ICLP-2003-LeeL #logic programming: Loop Formulas for Disjunctive Logic Programs (JL, VL), pp. 451–465.
ICLP-2003-LoyerS #logic programming #nondeterminism: Default Knowledge in Logic Programs with Uncertainty (YL, US), pp. 466–480.
ICLP-2003-PemmasaniGDRR #logic programming #online: Online Justification for Tabled Logic Programs (GP, HFG, YD, CRR, IVR), pp. 500–501.
ICLP-2003-SahaR #evaluation #incremental #logic programming: Incremental Evaluation of Tabled Logic Programs (DS, CRR), pp. 392–406.
ICLP-2003-Serebrenik #analysis #logic programming #termination: Termination Analysis of Logic Programs: Extended Abstract (AS), pp. 507–508.
ICLP-2003-SerebrenikD #logic programming #refactoring: Refactoring Logic Programs: Extended Abstract (AS, BD), pp. 509–510.
ICLP-2003-Smaus03a #logic programming #termination: Termination of Logic Programs for Various Dynamic Selection Rules (JGS), pp. 511–512.
ICLP-2003-ZhaoL #case study #programming #set: Answer Set Programming Phase Transition: A Study on Randomly Generated Programs (YZ, FL), pp. 239–253.
DocEng-2002-CollardMM #documentation: Supporting document and data views of source code (MLC, JIM, AM), pp. 34–41.
JCDL-2002-Griffin #library: Planning for future digital libraries programs (SMG), p. 370.
CSEET-2002-FraileyM #education #industrial #using: Using SWEBOK for Education Programs in Industry and Academia (DJF, JM), p. 6–?.
CSEET-2002-HislopLVU #re-engineering: Panel 1: Changing Conditions for Undergraduate Software Engineering Programs (GWH, MJL, RBV, DAU), pp. 250–251.
CSEET-2002-JovanovicMMSM #lessons learnt #re-engineering: Panel 3: Software Engineering Masters Programs — Lessons Learned (VMJ, KLM, DM, DS, PEM), pp. 253–255.
SCAM-J-2001-Vanter02: The documentary structure of source code (MvdV), pp. 767–782.
CSMR-2002-Leitao #lisp #pattern matching #refactoring: A Formal Pattern Language for Refactoring of Lisp Programs (APTdMCL), pp. 186–192.
ICSM-2002-EisenbarthKS #incremental #scalability: Incremental Location of Combined Features for Large-Scale Programs (TE, RK, DS), pp. 273–282.
ICSM-2002-Torchiano #java: Documenting Pattern Use in Java Programs (MT), pp. 230–233.
IWPC-2002-MaleticCM #documentation: Source Code Files as Structured Documents (JIM, MLC, AM), pp. 289–292.
SCAM-2002-Balmas #dependence #documentation #graph #using: Using Dependence Graphs as a Support to Document Programs (FB), pp. 145–154.
SCAM-2002-Baxter #analysis #parallel: Parallel Support for Source Code Analysis and Modification (IDB), p. 3–?.
SCAM-2002-BischofBLRV #matlab: Combining Source Transformation and Operator Overloading Techniques to Compute Derivatives for MATLAB Programs (CHB, HMB, BL, AR, AV), pp. 65–72.
SCAM-2002-Ghosh #concurrent #fault #metric #object-oriented #testing #towards #using: Towards Measurement of Testability of Concurrent Object-Oriented Programs Using Fault Insertion: A Preliminary Investigation (SG), pp. 17–25.
SCAM-2002-RillingLG #message passing #slicing: Predicate-Based Dynamic Slicing of Message Passing Programs (JR, HFL, DG), p. 133–?.
SCAM-2002-XuCY #debugging #object-oriented #slicing: Dynamic Slicing Object-Oriented Programs for Debugging (BX, ZC, HY), pp. 115–122.
WCRE-2002-McArthurMN #representation #using #xml: An Extensible Tool for Source Code Representation Using XML (GM, JM, SKKN), p. 199–?.
WCRE-2002-MittermeirC #spreadsheet: Finding High-Level Structures in Spreadsheet Programs (RM, MC), pp. 221–232.
WCRE-2002-RillingM #3d #analysis #on the #using #visual notation: On the Use of Metaballs to Visually Map Source Code Structures and Analysis Results onto 3D Space (JR, SPM), pp. 299–308.
ICALP-2002-AblayevMP #bound #branch #probability #quantum: Quantum and Stochastic Branching Programs of Bounded Width (FMA, CM, CP), pp. 343–354.
AFP-2002-ClaessenRCHW02 #functional #lazy evaluation #quickcheck #testing #using: Testing and Tracing Lazy Functional Programs Using QuickCheck and Hat (KC, CR, OC, JH, MW), pp. 59–99.
AFP-2002-Felleisen02 #interactive #web: Developing Interactive Web Programs (MF), pp. 100–128.
FLOPS-2002-LoyerS #logic programming #nondeterminism #semantics: The Well-Founded Semantics in Normal Logic Programs with Uncertainty (YL, US), pp. 152–166.
FLOPS-2002-Meer #algebra #consistency #constraints #on the: On Consistency and Width Notions for Constraint Programs with Algebraic Constraints (KM), pp. 88–102.
VISSOFT-2002-LewerentzS #3d #object-oriented #scalability #visualisation: Metrics-Based 3D Visualization of Large Object-Oriented Programs (CL, FS), p. 70–?.
VISSOFT-2002-Ploix: Analogical Representations of Programs (DP), pp. 61–69.
VISSOFT-2002-RillingSB #analysis #complexity #concept #visualisation: The CONCEPT Project — Applying Source Code Analysis to Reduce Information Complexity of Static and Dynamic Visualization Techniques (JR, AS, CB), p. 90.
KDD-2002-UgurelKG #automation #classification #what: What’s the code?: automatic classification of source code archives (SU, RK, CLG), pp. 639–644.
KR-2002-Lin #equivalence #logic programming: Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic (FL), pp. 170–176.
SEKE-2002-MensMW #maintenance: Maintaining software through intentional source-code views (KM, TM, MW), pp. 289–296.
AdaEurope-2002-ChenBZY #ada #analysis #concurrent #dependence: Static Dependency Analysis for Concurrent Ada 95 Programs (ZC, BX, JZ, HY), pp. 219–230.
ASIA-PEPM-2002-Voigtlander #parametricity #using: Using circular programs to deforest in accumulating parameters (JV), pp. 126–137.
LOPSTR-2002-AlpuenteCEFL #functional: Abstract Diagnosis of Functional Programs (MA, MC, SE, MF, SL), pp. 1–16.
LOPSTR-2002-ColvinHHS #higher-order #logic programming #refinement: Refinement of Higher-Order Logic Programs (RC, IJH, DH, PAS), pp. 126–143.
LOPSTR-2002-FioravantiPP #higher-order #logic #logic programming #monad #program transformation: Combining Logic Programs and Monadic Second Order Logics by Program Transformation (FF, AP, MP), pp. 160–181.
LOPSTR-2002-GrecoGTZ #optimisation #query: Translating Datalog-Like Optimization Queries into ILOG Programs (GG, SG, IT, EZ), pp. 48–49.
LOPSTR-2002-PeraltaG #abstraction: Convex Hull Abstractions in Specialization of CLP Programs (JCP, JPG), pp. 90–108.
LOPSTR-2002-VanhoofTB #fixpoint #logic programming #semantics: A Fixed Point Semantics for Logic Programs Extended with Cuts (WV, RT, MB), pp. 238–257.
LOPSTR-2002-Vidal #declarative #multi #partial evaluation #slicing: Forward Slicing of Multi-paradigm Declarative Programs Based on Partial Evaluation (GV), pp. 219–237.
PADL-2002-GallagherP #abstract interpretation #analysis #automaton #finite #logic programming #nondeterminism: Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs (JPG, GP), pp. 243–261.
PADL-2002-Rhiger #compilation #embedded: Compiling Embedded Programs to Byte Code (MR), pp. 120–136.
PADL-2002-YangG #data type #logic programming #performance: Exploiting Efficient Control and Data Structures in Logic Programs (RY, SG), pp. 318–331.
PEPM-2002-Lu #analysis #logic programming: Path dependent analysis of logic programs (LL), pp. 63–74.
PLDI-2002-ChilimbiH #data type: Dynamic Hot Data Stream Prefetching for General-Purpose Programs (TMC, MH), pp. 199–209.
PLDI-2002-ChoiLLOSS #concurrent #detection #object-oriented #parallel #performance #precise #thread: Efficient and Precise Datarace Detection for Multithreaded Object-Oriented Programs (JDC, KL, AL, RO, VS, MS), pp. 258–269.
PLDI-2002-RajagopalanDHS #optimisation: Profile-Directed Optimization of Event-Based Programs (MR, SKD, MAH, RDS), pp. 106–116.
PLDI-2002-Wu #performance: Efficient Discovery of Regular Stride Patterns in Irregular Programs (YW), pp. 210–221.
POPL-2002-AbadiB #logic programming #protocol #security: Analyzing security protocols with secrecy types and logic programs (MA, BB), pp. 33–44.
POPL-2002-ChakiRR #message passing #model checking #modelling: Types as models: model checking message-passing programs (SC, SKR, JR), pp. 45–57.
PPDP-2002-LagoonS #analysis #logic programming #precise: Precise pair-sharing analysis of logic programs (VL, PJS), pp. 99–108.
SAS-2002-BruynoogheCGV #analysis #logic programming #reuse #termination #using: Reuse of Results in Termination Analysis of Typed Logic Programs (MB, MC, SG, WV), pp. 477–492.
SAS-2002-MesnardPN #detection #logic programming #termination: Detecting Optimal Termination Conditions of Logic Programs (FM, ÉP, UN), pp. 509–526.
SAS-2002-SerebrenikS #float #logic programming #on the #termination: On Termination of Logic Programs with Floating Point Computations (AS, DDS), pp. 151–164.
SAS-2002-VaucheretB #logic programming #performance #precise #type inference: More Precise Yet Efficient Type Inference for Logic Programs (CV, FB), pp. 102–116.
ASE-2002-EllmanDF #animation #knowledge-based #simulation #synthesis: Knowledge-Based Synthesis of Numerical Programs for Simulation of Rigid-Body Systems in Physics-Based Animation (TE, RD, JF), p. 93–?.
ASE-2002-GueheneucDJ #dynamic analysis #java: No Java without Caffeine: A Tool for Dynamic Analysis of Java Programs (YGG, RD, NJ), p. 117–?.
FSE-2002-Zeller: Isolating cause-effect chains from computer programs (AZ), pp. 1–10.
ICSE-2002-DemskyR #object-oriented: Role-based exploration of object-oriented programs (BD, MCR), pp. 313–334.
ICSE-2002-DengDHM #concurrent #invariant #specification #synthesis #verification: Invariant-based specification, synthesis, and verification of synchronization in concurrent programs (XD, MBD, JH, MM), pp. 442–452.
ICSE-2002-GreenhouseS #concurrent #evolution #policy: Assuring and evolving concurrent programs: annotations and policy (AG, WLS), pp. 453–463.
ICSE-2002-KusumotoIIMMT #java #metric: Function point measurement from Java programs (SK, MI, KI, SM, KM, MT), pp. 576–582.
ICSE-2002-Michail #using: Browsing and searching source code of applications written using a GUIframework (AM), pp. 327–337.
ICSE-2002-Robillard #representation: A representation for describing and analyzing concerns in source code (MPR), pp. 721–722.
ASPLOS-2002-RajwarG #execution #transaction: Transactional lock-free execution of lock-based programs (RR, JRG), pp. 5–17.
CC-2002-NeculaMRW #analysis #c #named #tool support: CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs (GCN, SM, SPR, WW), pp. 213–228.
HPCA-2002-SakamotoBKIK #generative #performance: Reverse Tracer: A Software Tool for Generating Realistic Performance Test Programs (MS, LB, AK, AI, YK), pp. 81–91.
HPDC-2002-MatthewsHJL #automation #backtracking #debugging: Backtracking and Re-Execution in the Automatic Debugging of Parallelized Programs (GM, RH, SJ, PFL), p. 150–?.
PDP-2002-GonzalezLRRRSP #parallel #profiling: Model Oriented Profiling of Parallel Programs (JAG, CL, JLR, CR, JMR, FdS, MP), p. 39–?.
PDP-2002-SeinstraK #layout #memory management #message passing #modelling: Incorporating Memory Layout in the Modeling of Message Passing Programs (FJS, DK), pp. 293–300.
ESOP-2002-FlanaganFQ #thread #verification: Thread-Modular Verification for Shared-Memory Programs (CF, SNF, SQ), pp. 262–277.
FASE-2002-KumarH #slicing: Better Slicing of Programs with Jumps and Switches (SK, SH), pp. 96–112.
FoSSaCS-2002-BoerGM #concurrent #constraints #correctness #proving: Proving Correctness of Timed Concurrent Constraint Programs (FSdB, MG, MCM), pp. 37–51.
STOC-2002-BertsimasV #random: Solving convex programs by random walks (DB, SV), pp. 109–115.
TACAS-2002-BasuKPR #model checking #recursion: Resource-Constrained Model Checking of Recursive Programs (SB, KNK, LRP, CRR), pp. 236–250.
TACAS-2002-DelzannoRB #automation #java #parallel #thread #towards #verification: Towards the Automated Verification of Multithreaded Java Programs (GD, JFR, LVB), pp. 173–187.
CAV-2002-FlanaganQS #composition #parallel #thread: A Modular Checker for Multithreaded Programs (CF, SQ, SAS), pp. 180–194.
ICLP-2002-AntoniouM #logic programming: Embedding Defeasible Logic into Logic Programs (GA, MJM), pp. 393–404.
ICLP-2002-Bonatti #infinity #modelling #reasoning: Reasoning with Infinite Stable Models II: Disjunctive Programs (PAB), pp. 333–346.
ICLP-2002-Craciunescu #equivalence #proving: Proving the Equivalence of CLP Programs (SC), pp. 287–301.
ICLP-2002-MaSX #logic programming: The Limits of Horn Logic Programs (SM, YS, KX), p. 467.
ICLP-2002-OlmerS #logic programming #prolog: Schema-Based Transformations of Logic Programs in λ-Prolog (PO, PS), p. 472.
ICLP-2002-PearceSSTW #logic programming #polynomial: A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report (DP, VS, TS, HT, SW), pp. 405–420.
ISSTA-2002-GroceV #heuristic #java #model checking #using: Model checking Java programs using structural heuristics (AG, WV), pp. 12–21.
ISSTA-2002-Naumovich #algorithm #java: A conservative algorithm for computing the flow of permissions in Java programs (GN), pp. 33–43.
ECDL-2001-Neuhold #library: Digital Library Programs: Current Status and Future Plans (EJN), p. 460.
CSEET-2001-JovanovicSS #independence #question #re-engineering: Independent Accreditation for Software Engineering Programs? (VMJ, DS, LS), pp. 75–76.
CSEET-2001-SindersonS #education #re-engineering: Undergraduate Software Engineering Education: The Body of Knowledge, Existing Programs and Accreditation (ES, LS), pp. 221–230.
CSMR-2001-BeszedesGSCG #c #maintenance #scalability #slicing: Dynamic Slicing Method for Maintenance of Large C Programs (ÁB, TG, ZMS, JC, TG), pp. 105–113.
ICSM-2001-AtkinsonG #analysis #data flow #implementation #performance #scalability: Implementation Techniques for Efficient Data-Flow Analysis of Large Programs (DCA, WGG), pp. 52–61.
ICSM-2001-ChenCWYZZM #cvs #named #using: CVSSearch: Searching through Source Code Using CVS Comments (AC, EC, JW, AYY, QZ, SZ, AM), p. 364–?.
ICSM-2001-EisenbachS #java: Changing Java Programs (SE, CS), pp. 479–487.
ICSM-2001-EveraarsAK #concurrent #coordination #using: Using Coordination to Restructure Sequential Source Code into a Concurrent Program (CTHE, FA, BK), p. 342–?.
ICSM-2001-MichaudSM #java #visualisation: Integrating Information Sources for Visualizing Java Programs (JM, MADS, HAM), p. 250–?.
ICSM-2001-PoloPR #case study #legacy #maintenance #metric #predict #using: Using Code Metrics to Predict Maintenance of Legacy Programs: A Case Study (MP, MP, FR), pp. 202–208.
ICSM-2001-ZhaoCU #concurrent #dependence #logic programming: A Program Dependence Model for Concurrent Logic Programs and its Applications (JZ, JC, KU), pp. 672–681.
IWPC-2001-CordySDM #design #named: HSML: Design Directed Source Code Hot Spots (JRC, KAS, TRD, AJM), pp. 145–154.
IWPC-2001-MosemannW #comprehension #navigation: Navigation and Comprehension of Programs by Novice Programmers (RM, SW), pp. 79–88.
IWPC-2001-Sneed #cobol #logic: Extracting Business Logic from Existing COBOL Programs as a Basis for Redevelopment (HMS), pp. 167–175.
IWPC-2001-StoreyBM #interactive #java: SHriMP Views: An Interactive Environment for Exploring Java Programs (MADS, CB, JM), pp. 111–112.
PASTE-2001-FlanaganF #detection #scalability: Detecting race conditions in large programs (CF, SNF), pp. 90–96.
PASTE-2001-RyderT #impact analysis #object-oriented: Change impact analysis for object-oriented programs (BGR, FT), pp. 46–53.
SCAM-2001-BurdR #analysis #automation #evolution #using: Using Automated Source Code Analysis for Software Evolution (LB, SR), pp. 206–212.
SCAM-2001-ChenXY #concurrent #detection: Detecting Dead Statements for Concurrent Programs (ZC, BX, HY), pp. 67–74.
SCAM-2001-HorganPW #analysis #java #metric #profiling #runtime: Measurement and Analysis of Runtime Profiling Data for Java Programs (JH, JFP, JW), pp. 124–132.
SCAM-2001-Vanter #tool support: Preserving the Documentary Structure of Source Code in Language-Based Transformation Tools (MvdV), pp. 133–143.
SCAM-2001-Ward #analysis #approach: The Formal Transformation Approach to Source Code Analysis and Manipulation (MPW), pp. 187–195.
WCRE-2001-Sneed #cobol #interface #legacy #xml: Wrapping Legacy COBOL Programs behind an XML-Interface (HMS), p. 189–?.
ICALP-2001-BoudolC #concurrent: Noninterference for Concurrent Programs (GB, IC), pp. 382–395.
ICALP-2001-FeigeL: The RPR2 Rounding Technique for Semidefinite Programs (UF, ML), pp. 213–224.
RTA-2001-KuhnemannGK #cumulative #functional: Relating Accumulative and Non-accumulative Functional Programs (AK, RG, KK), pp. 154–168.
FLOPS-2001-Almendros-JimenezB #bottom-up #evaluation #framework #functional #logic programming: A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs (JMAJ, ABT), pp. 153–169.
FLOPS-2001-BozzanoDM #bottom-up #effectiveness #first-order #linear #logic programming #semantics: An Effective Bottom-Up Semantics for First-Order Linear Logic Programs (MB, GD, MM), pp. 138–152.
FLOPS-2001-CaballeroLR #debugging #declarative #functional #lazy evaluation #logic programming: Theoretical Foundations for the Declarative Debugging of Lazy Functional Logic Programs (RC, FJLF, MRA), pp. 170–184.
FLOPS-2001-ChoiLH #compilation #functional #java #lazy evaluation #virtual machine: Compiling Lazy Functional Programs Based on the Spineless Tagless G-Machine for the Java Virtual Machine (KC, HiL, TH), pp. 92–107.
FLOPS-2001-DeransartS #logic programming: Well-Typed Logic Programs Are not Wrong (PD, JGS), pp. 280–295.
FLOPS-2001-Ferri-RamirezHR #functional #incremental #learning #logic programming: Incremental Learning of Functional Logic Programs (CF, JHO, MJRQ), pp. 233–247.
FLOPS-2001-LagoonS #analysis #framework #logic programming: A Framework for Analysis of Typed Logic Programs (VL, PJS), pp. 296–310.
FLOPS-2001-Sato #learning #logic programming: Parameterized Logic Programs where Computing Meets Learning (TS), pp. 40–60.
ICFP-2001-Grobauer: Cost Recurrences for DML Programs (BG), pp. 253–264.
IFL-2001-ButterfieldS #comparison #correctness #paradigm #proving: Proving Correctness of Programs with IO — A Paradigm Comparison (AB, GS), pp. 72–87.
SVIS-2001-EichelbergerG #java #on the #visualisation: On the Visualization of Java Programs (HE, JWvG), pp. 295–306.
SVIS-2001-Mehner #concurrent #debugging #java #named #uml #visualisation: JaVis: A UML-Based Visualization and Debugging Environment for Concurrent Java Programs (KM), pp. 163–175.
SVIS-2001-PauwJMSVY #execution #java #visualisation: Visualizing the Execution of Java Programs (WDP, EJ, NM, GS, JMV, JY), pp. 151–162.
CAiSE-2001-ShaoLFEG #data-driven #design #query: Querying Data-Intensive Programs for Data Design (JS, XL, GF, SME, WAG), pp. 203–218.
CIKM-2001-HsuLC #algorithm #generative #multi: A Near Optimal Algorithm for Generating Broadcast Programs on Multiple Channels (CHH, GL, ALPC), pp. 303–309.
SEKE-2001-GargiuloM #java #named: Gadget: A Tool for Extracting the Dynamic Structure of Java Programs (JG, SM), pp. 244–251.
ECOOP-2001-PolletCC #java #static analysis: Distinctness and Sharing Domains for Static Analysis of Java Programs (IP, BLC, AC), pp. 77–98.
OOPSLA-2001-BoyapatiR #java #type system: A Parameterized Type System for Race-Free Java Programs (CB, MCR), pp. 56–69.
TOOLS-EUROPE-2001-SevitskyPK #analysis #java #performance: An Information Exploration Tool for Performance Analysis of Java Programs (GS, WDP, RK), pp. 85–101.
LOPSTR-2001-PotikasRG #datalog #nondeterminism: A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs (PP, PR, MG), pp. 25–45.
PLDI-2001-BallMMR #abstraction #automation #c: Automatic Predicate Abstraction of C Programs (TB, RM, TDM, SKR), pp. 203–213.
PLDI-2001-GhiyaLS #ambiguity #analysis #c #memory management #on the #points-to: On the Importance of Points-to Analysis and Other Memory Disambiguation Methods for C Programs (RG, DML, DCS), pp. 47–58.
POPL-2001-Monniaux #analysis #monte carlo #probability: An abstract Monte-Carlo method for the analysis of probabilistic programs (DM), pp. 93–101.
POPL-2001-Yahav #concurrent #java #logic #safety #using #verification: Verifying safety properties of concurrent Java programs using 3-valued logic (EY), pp. 27–40.
PPDP-2001-BossiCR #logic programming #termination: Termination of Well-Typed Logic Programs (AB, NC, SR), pp. 73–81.
PPDP-2001-Esparza #declarative #model checking: Model Checking (with) Declarative Programs (JE), p. 37.
PPDP-2001-Lucas #on-demand #termination: Termination of On-Demand Rewriting and Termination of OBJ Programs (SL), pp. 82–93.
QAPL-2001-Fruhwirth #analysis #automation #complexity #concurrent: As Time Goes By II: More Automatic Complexity Analysis of Concurrent Rule Programs (TWF), pp. 185–206.
SAIG-2001-SasanoHT #generative #multi #performance #problem: Generation of Efficient Programs for Solving Maximum Multi-marking Problems (IS, ZH, MT), pp. 72–91.
SAIG-2001-Wakeling #design #functional: A Design Methodology for Functional Programs (DW), pp. 146–162.
SAS-2001-BertranBCN #communication #concurrent #imperative #parallel: Communication and Parallelism Introduction and Elimination in Imperative Concurrent Programs (MB, FXB, AC, MN), pp. 20–39.
SAS-2001-DorRS #analysis #c #integer #string: Cleanness Checking of String Manipulations in C Programs via Integer Analysis (ND, MR, SS), pp. 194–212.
SAS-2001-KomondoorH #identification #slicing #using: Using Slicing to Identify Duplication in Source Code (RK, SH), pp. 40–56.
SAS-2001-Lu #analysis #logic programming: Parameterizing a Groundness Analysis of Logic Programs (LL), pp. 146–164.
SAS-2001-MesnardN #logic programming #static analysis #termination: Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs (FM, UN), pp. 93–110.
SAS-2001-Monniaux #analysis #probability #termination: An Abstract Analysis of the Probabilistic Termination of Programs (DM), pp. 111–126.
SAS-2001-Rinard #analysis #parallel #thread: Analysis of Multithreaded Programs (MCR), pp. 1–19.
RE-2001-SmithHE #constraints #editing #logic #requirements #visual notation: Events and Constraints: A Graphical Editor for Capturing Logic Requirements of Programs (MHS, GJH, KE), pp. 14–22.
ASE-2001-Erwig #data type: Programs Are Abstract Data Types (ME), pp. 400–403.
ASE-2001-GiannakopoulouH #verification: Automata-Based Verification of Temporal Properties on Running Programs (DG, KH), pp. 412–416.
ASE-2001-GraunkeFKF #automation: Automatically Restructuring Programs for the We (PTG, RBF, SK, MF), pp. 211–222.
ASE-2001-HavelundR #monitoring #using: Monitoring Programs Using Rewriting (KH, GR), pp. 135–143.
ASE-2001-MarcusM #concept #identification: Identification of High-Level Concept Clones in Source Code (AM, JIM), pp. 107–114.
ASE-2001-MarinovK #automation #framework #java #named #novel #testing: TestEra: A Novel Framework for Automated Testing of Java Programs (DM, SK), p. 22–?.
ASE-2001-SyD #automation #float #generative #integer #testing: Automatic Test Data Generation for Programs with Integer and Float Variables (NTS, YD), pp. 13–21.
ESEC-FSE-2001-ClarkeJRZ #generative #named #specification: STG: a tool for generating symbolic test programs and oracles from operational specifications (DC, TJ, VR, EZ), pp. 301–302.
ICSE-2001-KamiyaOKKI #java #maintenance #tool support: Maintenance Support Tools for JAVA Programs: CCFinder and JAAT (TK, FO, KK, SK, KI), pp. 837–838.
ICSE-2001-ModesittBW #overview #re-engineering #what: Academic Software Engineering: What Is and What Could Be? Results of the First Annual Survey for International SE Programs (KLM, DJB, LHW), pp. 643–652.
ICSE-2001-MurphyLWR #case study: Separating Features in Source Code: An Exploratory Study (GCM, AL, RJW, MPR), pp. 275–284.
ICSE-2001-Shepard #performance #set: An Efficient Set of Software Degree Programs for One Domain (TS), pp. 623–632.
ICSE-2001-WohlstadterJD #generative: Generating Wrappers for Command Line Programs: The Cal-Aggie Wrap-O-Matic Project (EW, SJ, PTD), pp. 243–252.
SAC-2001-WahlsL #algorithm #concurrent #constraints #modelling #semantics #specification: Formal semantics of an algorithm for translating model-based specifications to concurrent constraint programs (TW, GTL), pp. 567–575.
CC-2001-OttoniRARM #embedded: Optimal Live Range Merge for Address Register Allocation in Embedded Programs (GO, SR, GA, SR, SM), pp. 274–288.
CC-2001-RinetzkyS #analysis #interprocedural #recursion: Interprocedural Shape Analysis for Recursive Programs (NR, SS), pp. 133–149.
CC-2001-RountevR #analysis #library #points-to: Points-to and Side-Effect Analyses for Programs Built with Precompiled Libraries (AR, BGR), pp. 20–36.
PDP-2001-FolinoS #predict: Predictability of Cellular Programs Implemented with CAMELot (GF, GS), pp. 468–474.
PDP-2001-GonzalezLRRSPP #predict: Predicting the Time of Oblivious Programs (JAG, CL, JLR, CR, FdS, FP, MP), pp. 363–368.
PDP-2001-MarescaZ #image #parallel #video: Restructuring the Flow of Image and Video Processing Programs to Increase Instruction Level Parallelism (MM, NZ), p. 386–?.
PPoPP-2001-LuCZ #distributed #memory management #replication: Contention elimination by replication of sequential sections in distributed shared memory programs (HL, ALC, WZ), pp. 53–61.
PPoPP-2001-SalcianuR #analysis #parallel #pointer #thread: Pointer and escape analysis for multithreaded programs (AS, MCR), pp. 12–23.
ESOP-2001-BossiERS #logic programming #scheduling #semantics #termination: Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling (AB, SE, SR, JGS), pp. 402–416.
ESOP-2001-Monniaux #abstract interpretation #probability: Backwards Abstract Interpretation of Probabilistic Programs (DM), pp. 367–382.
FoSSaCS-2001-JensenS #abstract interpretation #analysis #object-oriented: Class Analysis of Object-Oriented Programs through Abstract Interpretation (TPJ, FS), pp. 261–275.
STOC-2001-Muller-OlmS #on the #parallel #slicing: On optimal slicing of parallel programs (MMO, HS), pp. 647–656.
TACAS-2001-BallPR #abstraction #c #model checking: Boolean and Cartesian Abstraction for Model Checking C Programs (TB, AP, SKR), pp. 268–283.
TACAS-2001-PasareanuDV #java #model checking: Finding Feasible Counter-examples when Model Checking Abstracted Java Programs (CSP, MBD, WV), pp. 284–298.
CAV-2001-EsparzaS #model checking #recursion: A BDD-Based Model Checker for Recursive Programs (JE, SS), pp. 324–336.
CSL-2001-Bezem #higher-order #logic programming: An Improved Extensionality Criterion for Higher-Order Logic Programs (MB), pp. 203–216.
CSL-2001-OHearnRY #data type #reasoning: Local Reasoning about Programs that Alter Data Structures (PWO, JCR, HY), pp. 1–19.
ICLP-2001-DeneckerPB #logic programming #semantics: Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates (MD, NP, MB), pp. 212–226.
ICLP-2001-DrabentM #approach #correctness #declarative #proving: Proving Correctness and Completeness of Normal Programs — A Declarative Approach (WD, MM), pp. 284–299.
ICLP-2001-ErdemL #theorem: Fages’ Theorem for Programs with Nested Expressions (EE, VL), pp. 242–254.
ICLP-2001-LoncT #complexity #logic programming #parametricity #semantics: Fixed-Parameter Complexity of Semantics for Logic Programs (ZL, MT), pp. 197–211.
ICLP-2001-OrejasPP #embedded #logic programming #semantics: Semantics of Normal Logic Programs with Embedded Implications (FO, EP, EP), pp. 255–268.
IJCAR-2001-AngerKL #logic programming #reasoning #semantics #set: NoMoRe : A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics (CA, KK, TL), pp. 325–330.
IJCAR-2001-EglyS #composition #proving: Deriving Modular Programs from Short Proofs (UE, SS), pp. 561–577.
IJCAR-2001-GanzingerM #bottom-up #logic programming #theorem: A New Meta-complexity Theorem for Bottom-Up Logic Programs (HG, DAM), pp. 514–528.
IJCAR-2001-Pientka #higher-order #logic programming #reduction #termination: Termination and Reduction Checking for Higher-Order Logic Programs (BP), pp. 401–415.
LICS-2001-AlfaroHM #verification: From Verification to Control: Dynamic Programs for ω-Regular Objectives (LdA, TAH, RM), pp. 279–290.
CSEET-2000-SebernL #re-engineering: Developing Undergraduate Software Engineering Programs (MJS, MJL), pp. 305–306.
WCRE-J-1997-StoreyWM00 #comprehension #how #question #tool support: How do program understanding tools affect how programmers understand programs? (MADS, KW, HAM), pp. 183–207.
CSMR-2000-Sneed #component #distributed #generative #reuse: Generation of Stateless Components from Procedural Programs for Reuse in a Distributed System (HMS), pp. 183–188.
ICSM-2000-KimbleW #analysis: An Alternative Source Code Analysis (JEKJ, LJW), pp. 64–75.
IWPC-2000-RaysideRHK #algorithm #automation #clustering #graph #object-oriented: The Effect of Call Graph Construction Algorithms for Object-Oriented Programs on Automatic Clustering (DR, SR, EH, KK), pp. 191–200.
WCRE-2000-MamasK #towards #using #xml: Towards Portable Source Code Representations using XML (EM, KK), p. 172–?.
WCRE-2000-Systa #behaviour #comprehension #java: Understanding the Behavior of Java Programs (TS), pp. 214–223.
IFM-2000-Dingel #development #distributed #parallel #towards: Towards a Unified Development Methodology for Shared-Variable Parallel and Distributed Programs (JD), pp. 214–234.
RTA-2000-OhlebuschCM #analysis #logic programming #named #termination: TALP: A Tool for the Termination Analysis of Logic Programs (EO, CC, CM), pp. 270–273.
ICFP-2000-ClaessenH #haskell #lightweight #named #quickcheck #random testing #testing: QuickCheck: a lightweight tool for random testing of Haskell programs (KC, JH), pp. 268–279.
ICFP-2000-SerranoB #comprehension #memory management: Understanding memory allocation of scheme programs (MS, HJB), pp. 245–256.
IFL-2000-ChitilRW #comparative #debugging #evaluation #functional #lazy evaluation: Freja, Hat and Hood — A Comparative Evaluation of Three Systems for Tracing and Debugging Lazy Functional Programs (OC, CR, MW), pp. 176–193.
IFL-2000-SargeantKW #functional #parallel: Exploiting Implicit Parallelism in Functional Programs with SLAM (JS, CCK, IW), pp. 19–36.
CIKM-2000-ChenP #array #generative: Dynamic Generation of Data Broadcasting Programs for a Broadcast Disk Array (MSC, WCP), pp. 38–45.
KDD-2000-Buchanan #information management #using: Informed knowledge discovery: using prior knowledge in discovery programs (BGB), p. 3.
KR-2000-Reiter: Narratives as Programs (RR), pp. 99–108.
UML-2000-MizunoSN #approach #concurrent #uml: A Structured Approach to Develop Concurrent Programs in UML (MM, GS, MLN), pp. 451–465.
ECOOP-2000-GuptaCH #exception #java #optimisation: Optimizing Java Programs in the Presence of Exceptions (MG, JDC, MH), pp. 422–446.
TOOLS-EUROPE-2000-HolmesL00a #concurrent #design #java #object-oriented: Designing Concurrent Object-Oriented Programs in Java (DH, DL), p. 461.
TOOLS-PACIFIC-2000-SkevoulisJ #detection #fault #invariant #java #runtime #static analysis: Generic Invariant-Based Static Analysis Tool for Detection of Runtime Errors in Java Programs (SS, XJ), pp. 36–44.
TOOLS-USA-2000-Kotula00a #documentation: Source Code Documentation: An Engineering Deliverable (JK), p. 505–?.
AdaEurope-2000-BliebergerBS #ada #analysis #data flow #detection: Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs (JB, BB, BS), pp. 225–237.
AdaEurope-2000-NonakaCU #ada #development #self: A Supporting Tool for Development of Self-Measurement Ada Programs (YN, JC, KU), pp. 69–81.
AdaEurope-2000-Ringler #analysis #execution #worst-case: Static Worst-Case Execution Time Analysis of Synchronous Programs (TR), pp. 56–68.
LOPSTR-2000-AvelloneFF #framework #logic programming #synthesis #verification: A formal framework for synthesis and verification of logic programs (AA, MF, CF).
LOPSTR-2000-FioravantiPP #automation #constraints #logic programming: Automated strategies for specializing constraint logic programs (FF, AP, MP).
LOPSTR-2000-PoernomoC #protocol #proving: Protocols between programs and proofs (IP, JNC).
LOPSTR-2000-SerebrenikS #analysis #logic programming #termination: Non-tranformational termination analysis of logic programs, based on general term-orderings (AS, DDS).
LOPSTR-2000-SeresS #higher-order #logic programming: Higher-order transformation of logic programs (SS, JMS).
LOPSTR-J-2000-AvelloneFF #framework #logic programming #synthesis #verification: A Formal Framework for Synthesis and Verification of Logic Programs (AA, MF, CF), pp. 1–17.
LOPSTR-J-2000-FioravantiPP #automation #constraints #logic programming: Automated Strategies for Specializing Constraint Logic Programs (FF, AP, MP), pp. 125–146.
LOPSTR-J-2000-PoernomoC #protocol #proving: Protocols between Programs and Proofs (IP, JNC), pp. 18–37.
LOPSTR-J-2000-SerebrenikS #analysis #logic programming #termination: Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings (AS, DDS), pp. 69–85.
LOPSTR-J-2000-SeresS #higher-order #logic programming: Higher-Order Transformation of Logic Programs (SS, JMS), pp. 57–68.
PADL-2000-GuptaA #constraints #interface #named #spreadsheet #visual notation: Knowledgesheet: A Graphical Spreadsheet Interface for Interactively Developing a Class of Constraint Programs (GG, SFA), pp. 308–323.
PADL-2000-MarinoM #functional #logic programming #static analysis #using: Using Static Analysis to Compile Non-sequential Functional Logic Programs (JM, JJMN), pp. 63–80.
PEPM-2000-Das #case study #experience #scalability #static analysis: Static Analysis of Large Programs: Some Experiences (MD), p. 1.
PPDP-2000-BozzanoDM #bottom-up #linear #logic programming #semantics: A bottom-up semantics for linear logic programs (MB, GD, MM), pp. 92–102.
PPDP-2000-HamonP #composition #data flow: Modular resetting of synchronous data-flow programs (GH, MP), pp. 289–300.
PPDP-2000-HanusS #functional #logic programming #nondeterminism #type system: Type-based nondeterminism checking in functional logic programs (MH, FS), pp. 202–213.
PPDP-2000-Lu #analysis #logic programming #precise: A precise type analysis of logic programs (LL), pp. 214–225.
SAIG-2000-BerardiCDG #functional #type system: Type-Based Useless-Code Elimination for Functional Programs (SB, MC, FD, PG), pp. 172–189.
SAIG-2000-FischerSP #data analysis #generative #modelling #statistics: Generating Data Analysis Programs from Statistical Models (BF, JS, TP), pp. 212–229.
SAIG-2000-Muller: Specialization of Systems Programs: Lessons and Perspectives (GM), pp. 7–8.
ASE-2000-VisserHBP #model checking: Model Checking Programs (WV, KH, GPB, SP), pp. 3–12.
FSE-2000-BehrendsS #approach #composition #concurrent #reliability: The universe model: an approach for improving the modularity and reliability of concurrent programs (RB, KS), pp. 20–29.
FSE-2000-Pethia #debugging: Bugs in the programs (RDP), p. 79.
FSE-2000-RobillardM #design #exception #java #robust: Designing robust Java programs with exceptions (MPR, GCM), pp. 2–10.
ICSE-2000-CorbettDHLPRZ #finite #java #modelling #named: Bandera: extracting finite-state models from Java source code (JCC, MBD, JH, SL, CSP, R, HZ), pp. 439–448.
ICSE-2000-CorbettDHR #interface #java #model checking #named: Bandera: a source-level interface for model checking Java programs (JCC, MBD, JH, R), pp. 762–765.
ICSE-2000-LopesK #aspectj #composition #design #using: Improving design and source code modularity using AspectJ (CVL, GK), p. 825.
SAC-2000-BoujarwahSA #analysis #data flow #java #testing #using: Testing Java Programs Using Dynamic Data Flow Analysis (ASB, KS, JAD), pp. 725–727.
SAC-2000-OrlandoPP #coordination #parallel: Coordinating HPF Programs to Mix Task and Data Parallelism (SO, PP, RP), pp. 240–247.
SAC-2000-SkillicornP #network: Building Programs in the Network of Tasks Model (DBS, SP), pp. 248–254.
CC-2000-GayS #analysis #performance #stack: Fast Escape Analysis and Stack Allocation for Object-Based Programs (DG, BS), pp. 82–93.
CC-2000-Thiemann #adaptation #compilation #partial evaluation: Compiling Adaptive Programs by Partial Evaluation (PT), pp. 264–278.
ISMM-2000-Steensgaard #concurrent #multi #thread: Thread-Specific Heaps for Multi-Threaded Programs (BS), pp. 18–24.
PDP-2000-AversaMMV #distributed #performance #simulation: A performance simulation technique for distributed programs: application to an SOR iterative solver (RA, BDM, NM, UV), pp. 368–375.
PDP-2000-Cerin #geometry #implementation #performance #problem #towards: Towards efficient BSP implementations of BSR programs for some computational geometry problems (CC), pp. 357–364.
PDP-2000-RoigRSGL #message passing #modelling: Modelling message-passing programs for static mapping (CR, AR, MAS, FG, EL), pp. 229–236.
PDP-2000-ZavanellaM #predict #using: Predictability of bulk synchronous programs using MPI (AZ, AM), pp. 118–123.
ESOP-2000-Charatonik #logic programming #type checking: Directional Type Checking for Logic Programs: Beyond Discriminative Types (WC), pp. 72–87.
ESOP-2000-ElgaardMS #c #debugging: Compile-Time Debugging of C Programs Working on Trees (JE, AM, MIS), pp. 119–134.
ESOP-2000-SeidlS #analysis #constraints #interprocedural #parallel: Constraint-Based Inter-Procedural Analysis of Parallel Programs (HS, BS), pp. 351–365.
FASE-2000-Dierks #algebra #process #realtime: A Process Algebra for Real-Time Programs (HD), pp. 66–81.
FASE-2000-HuizingK #invariant #object-oriented #using #verification: Verification of Object Oriented Programs Using Class Invariants (KH, RK), pp. 208–221.
CL-2000-AlferesHP #logic programming #modelling: Partial Models of Extended Generalized Logic Programs (JJA, HH, LMP), pp. 149–163.
CL-2000-BossiER #logic programming #semantics: Semantics of Input-Consuming Logic Programs (AB, SE, SR), pp. 194–208.
CL-2000-HruzaS #logic programming: Binary Speed Up for Logic Programs (JH, PS), pp. 116–130.
CL-2000-Janhunen #logic programming #strict: Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs (TJ), pp. 852–866.
CL-2000-KameyaS #learning #logic programming #performance: Efficient EM Learning with Tabulation for Parameterized Logic Programs (YK, TS), pp. 269–284.
CL-2000-LauO #logic programming #semantics: Isoinitial Semantics for Logic Programs (KKL, MO), pp. 223–238.
CL-2000-Lopez-FraguasH #functional #logic programming #proving: Proving Failure in Functional Logic Programs (FJLF, JSH), pp. 179–193.
CL-2000-Pallotta #composition #logic #logic programming #semantics: A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs (VP), pp. 777–791.
CL-2000-WangZL #fixpoint #logic programming: Alternating Fixpoint Theory for Logic Programs with Priority (KW, LZ, FL), pp. 164–178.
CSL-2000-HancockS #dependent type #interactive #type system: Interactive Programs in Dependent Type Theory (PH, AS), pp. 317–331.
CSL-2000-Pauly #bisimulation #game studies #safety: From Programs to Games: Invariance and Safety for Bisimulation (MP), pp. 485–496.
ISSTA-2000-Dill #java #model checking: Model checking Java programs (DLD), p. 179.
ISSTA-2000-NandaR #concurrent #slicing: Slicing concurrent programs (MGN, SR), pp. 180–190.
CSEET-1999-MengelU #analysis #case study #student: A Case Study of the Analysis of Novice Student Programs (SAM, JVU), pp. 40–49.
ITiCSE-1999-Armentrout #design #java #uml: A tool for designing Java programs with UML (AA), p. 180.
ICSM-1999-ChungKBKL #concurrent #specification #testing: Testing of Concurrent Programs After Specification Changes (ISC, HSK, HSB, YRK, DGL), p. 199–?.
ICSM-1999-SinhaH #java #testing: Criteria for Testing Exception-Handling Constructs in Java Programs (SS, MJH), p. 265–?.
ICSM-1999-ZhouB #ada #using: Extracting Objects of Ada Programs Using Module Features (YZ, BX), p. 23–?.
IWPC-1999-MartinoMMV #communication #interactive #parallel: Restructuring Parallel Programs by Transformation of Point-To-Point Interactions into Collective Communication (BDM, AM, NM, UV), pp. 84–91.
IWPC-1999-Zhao #concurrent #java #slicing: Slicing Concurrent Java Programs (JZ), pp. 126–133.
PASTE-1999-Balmas #paradigm #query: Query by Outlines: A New Paradigm to Help Manage Programs (FB), pp. 86–94.
PASTE-1999-ChoiGHS #analysis #exception #java #modelling #performance #precise: Efficient and Precise Modeling of Exceptions for the Analysis of Java Programs (JDC, DG, MH, VS), pp. 21–31.
PASTE-1999-FieldR #cobol #identification: Identifying Procedural Structure in Cobol Programs (JF, GR), pp. 1–10.
WCRE-1999-Balmas #named #query: QBO: A Query Tool Specially Developed to Explore Programs (FB), pp. 270–279.
ICALP-1999-AndreevBCR #bound #branch #pseudo #set: Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs (AEA, JLB, AEFC, JDPR), pp. 179–189.
FM-v1-1999-TyuguMP #synthesis: Applications of Structural Synthesis of Programs (ET, MM, JP), pp. 551–569.
FLOPS-1999-AlpuenteFMV #functional #lazy evaluation #logic programming: A Transformation System for Lazy Functional Logic Programs (MA, MF, GM, GV), pp. 147–162.
FLOPS-1999-BeierleM #approximate #prolog #type checking #using: Using Types as Approximations for Type Checking Prolog Programs (CB, GM), pp. 251–266.
FLOPS-1999-JohnsonRRR #evaluation #logic programming #performance: A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs (EJ, CRR, IVR, PR), pp. 284–300.
FLOPS-1999-Kuhnemann #comparison #deforestation #functional #transducer: Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers (AK), pp. 114–130.
FLOPS-1999-VerbaetenS #analysis #logic programming #termination #using: Termination Analysis of Tabled Logic Programs Using Mode and Type Information (SV, DDS), pp. 163–178.
ICFP-1999-AlpuenteHLV #functional #logic programming: Specialization of Inductively Sequential Functional Logic Programs (MA, MH, SL, GV), pp. 273–283.
ICFP-1999-Huch #abstract interpretation #erlang #using #verification: Verification of Erlang Programs using Abstract Interpretation and Model Mhecking (FH), pp. 261–272.
HCI-EI-1999-Stelovsky #architecture #eye tracking #integration #interactive #java #user interface: An Extendible Architecture for the Integration of Eye Tracking and User Interaction Events of Java Programs with Complex User Interfaces (JS), pp. 861–865.
ICEIS-1999-BouneffaBD: Analyzing the Impact of Schema Change on Application Programs (MB, HB, LD), pp. 37–44.
KDD-1999-BuntineFP #automation #data mining #mining #synthesis #towards: Towards Automated Synthesis of Data Mining Programs (WLB, BF, TP), pp. 372–376.
ECOOP-1999-PandeyH #data access #fine-grained #java: Providing Fine-grained Access Control for Java Programs (RP, BH), pp. 449–473.
ECOOP-1999-SchultzLCM #automation #java #towards: Towards Automatic Specialization of Java Programs (UPS, JLL, CC, GM), pp. 367–390.
OOPSLA-1999-WhaleyR #analysis #composition #java #pointer: Compositional Pointer and Escape Analysis for Java Programs (JW, MCR), pp. 187–206.
TOOLS-EUROPE-1999-ColnetZ #compilation #eiffel #optimisation: Optimizations of Eiffel Programs: Smalleiffel, the GNU Eiffel Compiler (DC, OZ), pp. 341–350.
TOOLS-EUROPE-1999-Waldron #bytecode #java #object-oriented: Dynamic Bytecode Usage by Object Oriented Java Programs (JW), pp. 384–395.
TOOLS-USA-1999-Mikhajlova #framework #java #specification #using: Specifying Java Frameworks Using Abstract Programs (AM), p. 136–?.
TOOLS-USA-1999-MiliDCGM #development #distributed #object-oriented #programming: View Programming for Decentralized Development of OO Programs (HM, JD, OC, RG, AM), pp. 210–221.
TOOLS-USA-1999-PeriyasamyL #metric #object-oriented #testing: A New Metrics Set for Evaluating Testing Efforts for Object-Oriented Programs (KP, XL), pp. 84–93.
AdaEurope-1999-BliebergerBS #ada #alias #evaluation #interprocedural #symbolic computation: Interprocedural Symbolic Evaluation of Ada Programs with Aliases (JB, BB, BS), pp. 136–145.
AdaEurope-1999-BrunetonP #ada #automation #concurrent #verification: Automatic Verification of Concurrent Ada Programs (EB, JFPP), pp. 146–157.
AdaEurope-1999-GonzalezC #ada #development #realtime #specification: Environment for the Development and Specification of Real-Time Ada Programs (AG, AC), pp. 124–135.
LOPSTR-1999-BertolinoEP: The Replacement Operation for CCP Programs (MB, SE, CP), pp. 216–233.
LOPSTR-1999-BossiCE: Transformation of Left Terminating Programs (AB, NC, SE), pp. 156–175.
LOPSTR-1999-HoweK #using: Specialising Fininte Domain Programs Using Polyhedra (JMH, AK), pp. 118–135.
LOPSTR-1999-PettorossiP #logic programming: Transformation Rules for Logic Programs with Goals as Arguments (AP, MP), pp. 176–195.
LOPSTR-1999-PueblaBH #constraints #debugging #logic programming: Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic Programs (GP, FB, MVH), pp. 273–292.
LOPSTR-1999-RossOS #recursion: Making Mercury Programs Tail Recursive (PR, DO, ZS), pp. 196–215.
LOPSTR-1999-SmausHK #analysis #logic programming: Mode Analysis Domains for Typed Logic Programs (JGS, PMH, AK), pp. 82–101.
PADL-1999-Vasconcelos #flexibility #framework #logic programming #slicing: A Flexible Framework for Dynamic and Static Slicing of Logic Programs (WWV), pp. 259–274.
PEPM-1999-HuTI #named #parallel #performance: Diffusion: Calculating Efficient Parallel Programs (ZH, MT, HI), pp. 85–94.
PEPM-1999-Jay #experience #partial evaluation: Partial Evaluation of Shaped Programs: Experience with FISh (CBJ), pp. 147–158.
PLDI-1999-RuginaR #analysis #parallel #pointer #thread: Pointer Analysis for Multithreaded Programs (RR, MCR), pp. 77–90.
PLDI-1999-YongHR #analysis #pointer: Pointer Analysis for Programs with Structures and Casting (SHY, SH, TWR), pp. 91–103.
POPL-1999-GuptaJP #concurrent #constraints #probability #process: Stochastic Processes as Concurrent Constraint Programs (VG, RJ, PP), pp. 189–202.
PPDP-1999-NeumerkelM #logic programming: Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices (UN, FM), pp. 328–342.
PPDP-1999-RoychoudhuryKRR #framework #logic programming: A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs (AR, KNK, CRR, IVR), pp. 396–413.
SAS-1999-AldrichCSE #analysis #java: Static Analyses for Eliminating Unnecessary Synchronization from Java Programs (JA, CC, EGS, SJE), pp. 19–38.
SAS-1999-HatcliffCDSZ #concurrent #formal method #multi #slicing #thread #virtual machine: A Formal Study of Slicing for Multi-threaded Programs with JVM Concurrency Primitives (JH, JCC, MBD, SS, HZ), pp. 1–18.
ESEC-FSE-1999-NaumovichAC #algorithm #concurrent #java #performance: An Efficient Algorithm for Computing MHP Information for Concurrent Java Programs (GN, GSA, LAC), pp. 338–354.
ESEC-FSE-1999-RobillardM #exception #java: Analyzing Exception Flow in Java Programs (MPR, GCM), pp. 322–327.
ICSE-1999-EzranMT #case study #experience #industrial #reuse #synthesis: Failure and Success Factors in Reuse Programs: A Synthesis of Industrial Experiences (ME, MM, CT), pp. 681–682.
ICSE-1999-NaumovichAC #analysis #concurrent #data flow #java: Data Flow Analysis for Checking Properties of Concurrent Java Programs (GN, GSA, LAC), pp. 399–410.
ICSE-1999-SinhaHR #control flow #interprocedural #slicing: System-Dependence-Graph-Based Slicing of Programs with Arbitrary Interprocedural Control Flow (SS, MJH, GR), pp. 432–441.
SAC-1999-RauberR #coordination #parallel: A Coordination Language for Mixed Task and and Data Parallel Programs (TR, GR), pp. 146–155.
CC-1999-DebrayMW: Link-Time Improvement of Scheme Programs (SKD, RM, SAW), pp. 76–90.
DAC-1999-UrY #architecture #generative: Micro Architecture Coverage Directed Generation of Test Programs (SU, YY), pp. 175–180.
DATE-1999-Dewilde #design #scalability: Large European Programs in Microelectronic System and Circuit Design (PD), p. 734–?.
HPDC-1999-AgbariaF #clustering #fault tolerance #named: Starfish: Fault-Tolerant Dynamic MPI Programs on Clusters of Workstations (AA, RF), pp. 167–176.
PDP-1999-Jose #approach #parallel: An approach to mapping parallel programs on hypercube multiprocessors (AJ), pp. 221–225.
PPoPP-1999-KnoopS #parallel: Code Motion for Explicitly Parallel Programs (JK, BS), pp. 13–24.
PPoPP-1999-LeePM #algorithm #compilation #parallel: Basic Compiler Algorithms for Parallel Programs (JL, DAP, SPM), pp. 1–12.
ESOP-1999-PodelskiCM #analysis #concurrent #constraints #logic programming: Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs (AP, WC, MM), pp. 177–192.
ESOP-1999-SabelfeldS #data flow: A Per Model of Secure Information Flow in Sequential Programs (AS, DS), pp. 40–58.
TACAS-1999-Heljanko #concurrent #logic programming #petri net #problem #reachability #semantics #using: Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets (KH), pp. 240–254.
CSL-1999-VosV #game studies #logic programming #nash: Choice Logic Programs and Nash Equilibria in Strategic Games (MDV, DV), pp. 266–276.
ICLP-1999-AlferesPS #abduction: Well-founded Abduction via Tabled Dual Programs (JJA, LMP, TS), pp. 426–440.
ICLP-1999-Bezem #logic programming: Extensionality of Simply Typed Logic Programs (MB), pp. 395–410.
ICLP-1999-BuccafurriFL #inheritance #logic programming: Disjunctive Logic Programs with Inheritance (FB, WF, NL), pp. 79–93.
ICLP-1999-DekhtyarDS #logic programming #probability: Temporal Probabilistic Logic Programs (AD, MID, VSS), pp. 109–123.
ICLP-1999-LauO #logic programming #modelling: Isoinitial Models for Logic Programs: Some Preliminary Results (KKL, MO), p. 611.
ICLP-1999-LuC #analysis #logic programming: A Regular Type Analysis of Logic Programs (LL, JGC), p. 613.
ICLP-1999-MarinoM #functional #logic programming #static analysis #using: Using Static Analysis to Compile Non-sequential Functional Logic Programs (JM, JJMN), p. 614.
ICLP-1999-OrejasP #semantics: Semantic Definitions for Normal Open Programs (FO, EP), pp. 200–214.
ICLP-1999-PedreschiR #bound #logic programming #nondeterminism: Bounded Nondeterminism of Logic Programs (DP, SR), pp. 350–364.
ICLP-1999-RoychoudhuryKR #logic programming: Generalized Unfold/fold Transformation Systems for Normal Logic Programs (AR, KNK, IVR), p. 616.
ICLP-1999-Smaus #logic programming #proving #termination: Proving Termination of Input-Consuming Logic Programs (JGS), pp. 335–349.
ICLP-1999-Verbaeten #abduction #analysis #logic programming #termination: Termination Analysis for Abductive General Logic Programs (SV), pp. 365–379.
PODS-1998-VorobyovV #complexity #logic programming #recursion: Complexity of Nonrecursive Logic Programs with Complex Values (SGV, AV), pp. 244–253.
ITiCSE-1998-CallaghanH #3d #design pattern #education #java #visualisation: 3-D visualisation of design patterns and Java programs in computer science education (MC, HH), pp. 37–40.
ITiCSE-1998-Naps #algorithm #java #student #visualisation: A Java visualiser class: incorporating algorithm visualisations into students’ programs (TLN), pp. 181–184.
CSMR-1998-NiessinkV #maturity #metric #towards: Towards Mature Measurement Programs (FN, HvV), pp. 82–88.
CSMR-1998-OhtaMI #on the #verification: On Constructing a Tool to Verify Programs for Processors Built in Machines (TO, NM, YI), pp. 52–59.
CSMR-1998-ZhaoCU98a #concurrent #logic programming #metric: A Metrics Suite for Concurrent Logic Programs (JZ, JC, KU), pp. 172–178.
ICSM-1998-SinhaH #analysis: Analysis of Programs with Exception-Handling Constructs (SS, MJH), pp. 348–357.
IWPC-1998-CanforaCLL #legacy #migration #platform #towards: Decomposing Legacy Programs: A First Step Towards Migrating to Client-Server Platforms (GC, AC, ADL, GADL), pp. 136–144.
IWPC-1998-ErdosS #comprehension #maintenance: Partial Comprehension of Complex Programs (enough to perform maintenance) (KE, HMS), pp. 98–105.
IWPC-1998-KorelR #comprehension #scalability #slicing: Program Slicing in Understanding of Large Programs (BK, JR), pp. 145–152.
IWPC-1998-MancoridisMRCG #automation #clustering #using: Using Automatic Clustering to Produce High-Level System Organizations of Source Code (SM, BSM, CR, YFC, ERG), pp. 45–52.
IWPC-1998-SimCH #code search #developer #maintenance #overview: Archetypal Source Code Searches: A Survey of Software Developers and Maintainers (SES, CLAC, RCH), pp. 180–187.
PASTE-1998-ChaseCHY #analysis #architecture #multi: Recovering Software Architecture from Multiple Source Code Analyses (MPC, SMC, DRH, ASY), pp. 43–50.
PASTE-1998-Krinke #slicing #thread: Static Slicing of Threaded Programs (JK), pp. 35–42.
PASTE-1998-NaumovichCO #analysis #concurrent #data flow #performance: Efficient Composite Data Flow Analysis Applied to Concurrent Programs (GN, LAC, LJO), pp. 51–58.
PASTE-1998-WadellA #higher-order #performance #visualisation: Visualizing the Performance of Higher-Order Programs (OW, JMA), pp. 75–82.
WCRE-1998-TheodorosEBW #design #named #object-oriented #reverse engineering: ROMEO: Reverse Engineering from OO Source Code to OMT Design (TL, HME, AB, NW), pp. 191–200.
WCRE-1998-ValasareddiC #graph #identification #process: A Graph-Based Object Identification Process for Procedural Programs (RRV, DLC), pp. 50–58.
ICALP-1998-Ben-AmramP: CONS-Free Programs with Tree Input (AMBA, HP), pp. 271–282.
ICALP-1998-JuknaZ #bound #branch #nondeterminism #on the: On Branching Programs With Bounded Uncertainty (SJ, SZ), pp. 259–270.
ICALP-1998-Zakharov #approach #decidability #equivalence #performance: An Efficient and Unified Approach to the Decidability of Equivalence of Propositional Programs (VAZ), pp. 247–258.
WIA-1998-LHerPM #automaton #proving #using: Proving Sequential Function Chart Programs Using Automata (DL, PLP, LM), pp. 149–163.
FLOPS-1998-Nedjah #equation: Postponing Redex Contractions in Equational Programs (NN), pp. 40–60.
ICFP-1998-Karczmarczuk #difference #functional: Functional Differentiation of Computer Programs (JK), pp. 195–203.
ICFP-1998-ZhangL #automation #incremental: Automating Derivation of Incremental Programs (YZ, YAL), p. 350.
IFL-1998-CharlesR #approach #functional #interactive #parallel #profiling: An Interactive Approach to Profiling Parallel Functional Programs (NC, CR), pp. 20–37.
ICML-1998-ReddyT #first-order #learning: Learning First-Order Acyclic Horn Programs from Entailment (CR, PT), pp. 472–480.
ICML-1998-SalustowiczS #evolution: Evolving Structured Programs with Hierarchical Instructions and Skip Nodes (RS, JS), pp. 488–496.
KR-1998-BrewkaE #logic programming #set: Preferred Answer Sets for Extended Logic Programs (GB, TE), pp. 86–97.
KR-1998-GiacomoRS #execution #monitoring: Execution Monitoring of High-Level Robot Programs (GDG, RR, MS), pp. 453–465.
ECOOP-1998-GilI #analysis #complexity #object-oriented: The Complexity of Type Analysis of Object Oriented Programs (JYG, AI), pp. 601–634.
AdaEurope-1998-BliebergerB #ada #analysis: Symbolic Reaching Definitions Analysis of Ada Programs (JB, BB), pp. 238–250.
AdaEurope-1998-BurnsDR #realtime: The Ravenscar Tasking Profile for High Integrity Real-Time Programs (AB, BD, GR), pp. 263–275.
ALP-PLILP-1998-BruynoogheVWD #detection #logic programming #query: Detecting Unsolvable Queries for Definite Logic Programs (MB, HV, DAdW, MD), pp. 118–133.
ALP-PLILP-1998-HanusS #declarative: Controlling Search in Declarative Programs (MH, FS), pp. 374–390.
ALP-PLILP-1998-LeviS #empirical #logic programming #refinement: An Experiment in Domain Refinement: Type Domains and Type Representations for Logic Programs (GL, FS), pp. 152–169.
ALP-PLILP-1998-MoreauK #commutative #compilation: A Compiler for Rewrite Programs in Associative-Commutative Theories (PEM, HK), pp. 230–249.
ALP-PLILP-1998-SmausHK #logic programming #termination: Termination of Logic Programs with block Declarations Running in Several Modes (JGS, PMH, AK), pp. 73–88.
ALP-PLILP-1998-VanhoofSM #bottom-up #framework #logic programming: A Framework for Bottom Up Specialisation of Logic Programs (WV, DDS, BM), pp. 54–72.
ALP-PLILP-1998-Wakeling #compilation #functional #haskell #java #lazy evaluation #mobile #virtual machine: Mobile Haskell: Compiling Lazy Functional Programs for the Java Virtual Machine (DW), pp. 335–352.
LOPSTR-1998-AvelloneFM #data type #synthesis: Synthesis of Programs in Abstract Data Types (AA, MF, PM), pp. 81–100.
LOPSTR-1998-BellotR #imperative #logic #synthesis: Logical Synthesis of Imperative O. O. Programs (PB, BR), pp. 316–318.
LOPSTR-1998-BossiC #logic programming: Success in Logic Programs (AB, NC), pp. 219–239.
LOPSTR-1998-BossiR #logic programming #specification: Specialising Logic Programs with Respect to Call?Post Specifications (AB, SR), pp. 159–178.
LOPSTR-1998-BrogiCT #using: The Use of Renaming in Composing General Programs (AB, SC, FT), pp. 124–142.
LOPSTR-1998-HamfeltN #combinator #composition #induction #logic programming #synthesis: Inductive Synthesis of Logic Programs by Composition of Combinatory Program Schemes (AH, JFN), pp. 143–158.
LOPSTR-1998-HoarauM #compilation #constraints #logic programming #termination: Inferring and Compiling Termination for Constraint Logic Programs (SH, FM), pp. 240–254.
LOPSTR-1998-RobertsonA #logic programming #synthesis: Pragmatics in the Synthesis of Logic Programs (DSR, JAC), pp. 41–60.
LOPSTR-1998-Rosenblueth #using: An Exhaustive-Search Method Using Layered Streams Obtained Through a Meta-Interpreter for Chain Programs (DAR), pp. 322–324.
LOPSTR-1998-SmausHK #fault #logic programming #multi #using: Preventing Instantiation Errors and Loops for Logic Programs with Multiple Modes Using block Declarations (JGS, PMH, AK), pp. 289–307.
LOPSTR-1998-VanhoofSM #bottom-up #logic programming: Bottom-Up Specialisation of Logic Programs (WV, DDS, BM), pp. 325–327.
LOPSTR-1998-ZidoumFH #synthesis: Schema-Guided Synthesis of CLP Programs (HZ, PF, BH), pp. 309–312.
PLDI-1998-ColbyGJ #automation: Automatically Closing Open Reactive Programs (CC, PG, LJJ), pp. 345–357.
PLDI-1998-ZhuH #c #communication #optimisation #parallel: Communication Optimizations for Parallel C Programs (YZ, LJH), pp. 199–211.
SAS-1998-CharatonikP #logic programming #type inference: Directional Type Inference for Logic Programs (WC, AP), pp. 278–294.
SAS-1998-FagesG #analysis #logic programming: Analysis of Normal Logic Programs (FF, RG), pp. 82–98.
SAS-1998-PeraltaGS #analysis #constraints #imperative #logic programming: Analysis of Imperative Programs through Analysis of Constraint Logic Programs (JCP, JPG, HS), pp. 246–261.
SAS-1998-Volpe #alias #first-order #logic programming: A First-Order Language for Expressing Aliasing and Type Properties of Logic Programs (PV), pp. 184–199.
SIGAda-1998-DobbingB #realtime: The Ravenscar Tasking Profile for High Integrity Real-Time Programs (BD, AB), pp. 1–6.
SIGAda-1998-LaskiSH #ada #analysis #dependence: Dependency Analysis of Ada Programs (JWL, WS, JH), pp. 263–275.
ASE-1998-FlenerZH #constraints #logic programming #synthesis: Schema-Guided Synthesis of Constraint Logic Programs (PF, HZ, BH), pp. 168–176.
ASE-1998-MichaelM #automation #generative #testing: Automated Software Test Data Generation for Complex Programs (CCM, GM), pp. 136–146.
ICSE-1998-RothermelLDB #testing #visual notation #what: What You See Is What You Test: A Methodology for Testing Form-Based Visual Programs (GR, LL, CD, MMB), pp. 198–207.
ASPLOS-1998-KrintzCLZ #execution #mobile #strict #using: Overlapping Execution with Transfer Using Non-Strict Execution for Mobile Programs (CK, BC, HBL, BGZ), pp. 159–169.
CC-1998-GhiyaHZ #c #detection #parallel #recursion: Detecting Parallelism in C Programs with Recursive Darta Structures (RG, LJH, YZ), pp. 159–173.
CC-1998-Steindl #object-oriented #slicing: Intermodular Slicing of Object-oriented Programs (CS), pp. 264–279.
DAC-1998-Lin #concurrent #synthesis: Software Synthesis of Process-Based Concurrent Programs (BL), pp. 502–505.
DATE-1998-BasuLM: Register-Constrained Address Computation in DSP Programs (AB, RL, PM), pp. 929–930.
DATE-1998-Lin #compilation #concurrent #performance #runtime #scheduling: Efficient Compilation of Process-Based Concurrent Programs without Run-Time Scheduling (BL), pp. 211–217.
DATE-1998-ZhaoP #self #testing: Testing DSP Cores Based on Self-Test Programs (WZ, CAP), pp. 166–172.
HPDC-1998-HackstadtHM #distributed #framework: A Framework for Interacting with Distributed Programs and Data (STH, CWH, ADM), pp. 206–214.
HPDC-1998-ZhangSL #message passing #using: Dynamically Instrumenting Message-Passing Programs Using Virtual Clocks (KZ, CS, KCL), pp. 340–341.
PDP-1998-EspinosaML #automation #evaluation #parallel #performance: Automatic performance evaluation of parallel programs (AE, TM, EL), pp. 43–49.
PDP-1998-FlorioDTRL #distributed #embedded #fault tolerance #hypermedia #injection #monitoring #parallel: A hypermedia distributed application for monitoring and fault-injection in embedded fault-tolerant parallel programs (VDF, GD, MT, WR, RL), pp. 349–355.
ESOP-1998-Leino #logic #object-oriented #recursion: Recursive Object Types in a Logic of Object-Oriented Programs (KRML), pp. 170–184.
STOC-1998-Gal #bound: A Characterization of Span Program Size and Improved Lower Bounds for Monotone Span Programs (AG), pp. 429–437.
TACAS-1998-AikenFS #detection #logic programming: Detecting Races in Relay Ladder Logic Programs (AA, MF, ZS), pp. 184–200.
TACAS-1998-Grahlmann #automaton #finite #parallel #petri net #using: Combining Finite Automata, Parallel Programs and SDL Using Petri Nets (BG), pp. 102–117.
WRLA-1998-BorovanskyJMR: Handling ELAN rewrite programs via an exchange format (PB, SJ, PEM, CR), p. 173.
CADE-1998-ArtsDFG #distributed #erlang #verification: System Description: Verification of Distributed Erlang Programs (TA, MD, LÅF, DG), pp. 38–41.
CADE-1998-Malik #automation #deduction #finite: Automated Deduction of Finite-State Control Programs for Reactive Systems (RM), pp. 302–316.
ISSTA-1998-Corbett #concurrent #java #modelling: Constructing Compact Models of Concurrent Java Programs (JCC), pp. 1–10.
ISSTA-1998-YangSP #parallel: All-du-path Coverage for Parallel Programs (CSDY, ALS, LLP), pp. 153–162.
JICSLP-1998-FonsecaCD #execution #logic programming #named #parallel #visualisation: VisAll: A Universal Tool to Visualise Parallel Execution of Logic Programs (NAF, VSC, IdCD), pp. 100–114.
JICSLP-1998-HanusS #logic programming: Controlling Search in Funtional Logic Programs (MH, FS), pp. 347–348.
LICS-1998-FagesRS #concurrent #constraints #semantics #verification: Phase Semantics and Verification of Concurrent Constraint Programs (FF, PR, SS), pp. 141–152.
WCRE-1997-Balmas #concept #framework #towards: Toward a Framework for Conceptual and Formal Outlines of Programs (FB), pp. 226–235.
WCRE-1997-StoreyWM #comprehension #how #question #tool support: How Do Program Understanding Tools Affect How Programmers Understand Programs? (MADS, KW, HAM), p. 12–?.
WPC-1997-MarkovicHRB #automation #generative: Semi-automatic Generation of Parallelizable Patterns from Source Code Examples (DM, JRH, CSR, SB), pp. 50–59.
ICSM-2000-YoungerBL #concurrent #refinement: A Formal Transformation and Refinement Method for Concurrent Programs (EJY, KHB, ZL), p. 287–?.
ICALP-1997-Ablayev #branch #nondeterminism #order: Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs (FMA), pp. 195–202.
ICALP-1997-Ruggieri #constraints #logic programming #termination: Termination of Constraint Logic Programs (SR), pp. 838–848.
FME-1997-Charpentier #distributed: A UNITY Mapping Operator for Distributed Programs (MC), pp. 665–684.
FME-1997-MikhajlovaS #interface #object-oriented #refinement: Class Refinement and Interface Refinement in Object-Oriented Programs (AM, ES), pp. 82–101.
ICFP-1997-Ostvold #functional #induction #recursion #synthesis: Inductive Synthesis of Recursive Functional Programs (Poster Abstract) (BMØ), p. 323.
ICFP-1997-SabelfeldS #analysis #functional #problem #semantics: Simple Semantic Analysis Problems for Functional Programs (VKS, AS), p. 319.
IFL-1997-LoidlT #functional #parallel #scalability: Engineering Large Parallel Functional Programs (HWL, PWT), pp. 178–197.
OOPSLA-1997-LenceviciusHS #debugging #object-oriented: Query-Based Debugging of Object-Oriented Programs (RL, UH, AKS), pp. 304–317.
OOPSLA-1997-VolanschiCMC #declarative #object-oriented: Declarative Specialization of Object-Oriented Programs (ENV, CC, GM, CC), pp. 286–300.
TOOLS-ASIA-1997-StobartPT #case study #object-oriented #polymorphism #testing #using: Using Extended General Statecharts to Generate Test Cases for Overloaded/Polymorphic Object-Oriented Programs: A Case Study (SS, NP, BYT), pp. 96–103.
TOOLS-PACIFIC-1997-Meyer #contract #design #object-oriented: Design by Contract: Making Object-Oriented Programs that Work (BM), p. 360.
TOOLS-USA-1997-GilH #debugging #generative #testing #using: T++: A Test Case Generator Using a Debugging Information Based Technique for Source Code Manipulation (JYG, BH), pp. 272–281.
TOOLS-USA-1997-Mossenbock #visual notation: Films as Graphical Comments in the Source Code of Programs (HM), pp. 89–98.
AdaEurope-1997-Bell #ada #analysis #tool support: An Alternative Toolset for Analysis of Ada Programs (AEB), pp. 112–124.
AdaEurope-1997-Franch #ada #automation #implementation #non-functional: Including Non-functional Issues in Anna/Ada Programs for Automatic Implementation Selection (XF), pp. 88–99.
AdaEurope-1997-WegenerF #ada: Systematic Unit-Testing of Ada Programs (JW, IF), pp. 64–75.
ALP-1997-CodishT #analysis #constraints #logic programming #semantics #termination #using: A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm Constraints (MC, CT), pp. 31–45.
ALP-1997-GeserG #functional: Parallelizing Functional Programs by Generalization (AG, SG), pp. 46–60.
LOPSTR-1997-BossiC: Programs Without Failures (AB, NC), pp. 28–48.
LOPSTR-1997-HeatonHK #analysis #logic programming: Analysis of Logic Programs with Delay (AH, PMH, AK), pp. 148–167.
LOPSTR-1997-LafaveG #constraints #functional #logic programming #partial evaluation: Constraint-Based Partial Evaluation of Rewriting-Based Functional Logic Programs (LL, JPG), pp. 168–188.
LOPSTR-1997-LeuschelMS #logic programming #termination: Preserving Termination of Tabled Logic Programs While Unfolding (ML, BM, KFS), pp. 189–205.
LOPSTR-1997-MomiglianoO #logic programming #reasoning #towards: Towards a Logic for Reasoning About Logic Programs Transformation (AM, MO), pp. 226–244.
LOPSTR-1997-RichardsonF #development #prolog: Development of Correct Transformation Schemata for Prolog Programs (JR, NEF), pp. 263–281.
LOPSTR-1997-SaglamG #approximate #logic programming: Constrained Regular Approximation of Logic Programs (HS, JPG), pp. 282–299.
PEPM-1997-AlpuenteFJV #functional #lazy evaluation #logic programming: Specialization of Lazy Functional Logic Programs (MA, MF, PJI, GV), pp. 151–162.
PEPM-1997-DanvyS #equation #named #recursion #λ-calculus: λ-Dropping: Transforming Recursive Equations into Programs with Block Structure (OD, UPS), pp. 90–106.
PEPM-1997-MarinescuG #concurrent: Partial-Evaluation Techniques for Concurrent Programs (MM, BG), pp. 47–62.
PLDI-1997-CooperL #c: Register Promotion in C Programs (KDC, JL), pp. 308–319.
PLDI-1997-JensenJKS #automation #higher-order #logic #monad #pointer #using #verification: Automatic Verification of Pointer Programs using Monadic Second-Order Logic (JLJ, MEJ, NK, MIS), pp. 226–236.
PLILP-1997-HuangSS #logic programming #parallel: Selective Recomputation for Handling Side-Effects in Parallel Logic Programs (ZH, CS, AS), pp. 275–289.
POPL-1997-PettorossiPR #logic programming #nondeterminism: Reducing Nondeterminism while Specializing Logic Programs (AP, MP, SR), pp. 414–427.
SAS-1997-CodishLB #algebra #analysis #approach #logic programming: An Algebraic Approach to Sharing Analysis of Logic Programs (MC, VL, FB), pp. 68–82.
SAS-1997-HornofCN #effectiveness: Effective Specialization of Realistic Programs via Use Sensitivity (LH, CC, JN), pp. 293–314.
SAS-1997-PanitzS #automation #functional #higher-order #named #proving #strict #termination: TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language (SEP, MSS), pp. 345–360.
SAS-1997-YiR #effectiveness #estimation #exception #towards: Towards a Cost-Effective Estimation of Uncaught Exceptions in SML Programs (KY, SR), pp. 98–113.
SAS-1997-Zartmann #abstract interpretation #functional #logic programming: Denotational Abstract Interpretation of Functional Logic Programs (FZ), pp. 141–159.
TRI-Ada-1997-Conn #analysis: The Source Code Analysis Tool Construction Project (RLC), pp. 141–148.
ASE-1997-Ameur #comprehension #program analysis: A Contribution to Program Comprehension by Program Analysis: Application to Numerical Programs (YAA), pp. 134–142.
ASE-1997-ArmandoSG #automation #paradigm #recursion #synthesis: Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm (AA, AS, IG), pp. 2–9.
ASE-1997-CohenF #abstraction #automation #database #re-engineering: Automatic High-Quality Reengineering of Database Programs by Temporal Abstraction (YC, YAF), pp. 90–97.
ASE-1997-FlenerLO #synthesis: Correct-Schema-Guided Synthesis of Steadfast Programs (PF, KKL, MO), p. 153–?.
ASE-1997-GannodC #approach #automation #pointer #reverse engineering: A Formal Automated Approach for Reverse Engineering Programs with Pointers (GCG, BHCC), pp. 219–226.
ASE-1997-MatskinT #synthesis: Strategies of Structural Synthesis of Programs (MM, ET), pp. 305–306.
ASE-1997-Tan #component #data-driven #interface #reuse #usability: Enhancing the Component Reusability in Data-Intensive Business Programs through Interface Separation (HBKT), pp. 313–314.
ICSE-1997-SeiterLO #evolution #java: Simplifying the Evolution of Java Programs (LMS, KJL, DO), pp. 655–656.
SAC-1997-Li97a #execution #parallel: Analyzing the expected execution times of parallel programs (KL), pp. 488–495.
ASF+SDF-1997-Brunekreef #algebra #prolog #specification: An algebraic specification of a transformation tool for Prolog programs (JB), p. 7.
ASF+SDF-1997-Vigna #implementation #performance #towards: Towards an efficient implementation of distributive programs (SV), p. 13.
HPDC-1997-NetzerX #distributed #game studies: Replaying Distributed Programs without Message Logging (RHBN, YX), pp. 137–147.
PDP-1997-LefebvreF #parallel: Storage management in parallel programs (VL, PF), pp. 181–188.
PDP-1997-MoritzT #memory management #parallel: A static mapping system for logically shared memory parallel programs (CAM, LET), pp. 265–272.
PDP-1997-PasettoV #evaluation #independence #modelling: Machine-independent analytical models for cost evaluation of template-based programs (DP, MV), pp. 485–492.
PDP-1997-SenarRCL #approach #clustering #parallel #performance: An efficient clustering-based approach for mapping parallel programs (MAS, AR, AC, EL), pp. 407–412.
PPoPP-1997-ChandraL #communication #distributed #memory management #optimisation: Optimizing Communication in HPF programs for Fine-Grain Distributed Shared Memory (SC, JRL), pp. 100–111.
PPoPP-1997-FrensW #multi #performance: Auto-blocking Matrix-Multiplication or Tracking BLAS3 Performance with Source Code (JDF, DSW), pp. 206–216.
PPoPP-1997-Rinard #automation #effectiveness #using: Effective Fine-Grain Synchronization for Automatically Parallelized Programs Using Optimistic Synchronization Primitives (MCR), pp. 112–123.
SOSP-1997-SavageABNS #concurrent #detection #multi #named #thread: Eraser: A Dynamic Data Race Detector for Multi-Threaded Programs (SS, MB, GN, PS, TEA), pp. 27–37.
STOC-1997-RazborovWY #branch #calculus #proving: Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus (AAR, AW, ACCY), pp. 739–748.
TACAS-1997-Berry #hardware #optimisation #synthesis #verification: Hardware and Software Synthesis, Optimization, and Verification from Esterel Programs (GB), pp. 1–3.
TACAS-1997-BoigelotG #automation #specification #synthesis: Automatic Synthesis of Specifications from the Dynamic Observation of Reactive Programs (BB, PG), pp. 321–333.
TACAS-1997-KrimmM #composition #generative: Compositional State Space Generation from Lotos Programs (JPK, LM), pp. 239–258.
TAPSOFT-1997-AbadiL #logic #object-oriented: A Logic of Object-Oriented Programs (MA, KRML), pp. 682–696.
TAPSOFT-1997-MartinK #generative #logic programming #performance: Generating Efficient, Terminating Logic Programs (JCM, AK), pp. 273–284.
CAV-1997-CeceF #effectiveness: Programs with Quasi-Stable Channels are Effectively Recognizable (GC, AF), pp. 304–315.
CAV-1997-LindenstraussSS #logic programming #named #query #termination: TermiLog: A System for Checking Termination of Queries to Logic Programs (NL, YS, AS), pp. 444–447.
ICLP-1997-BuenoCL #analysis #logic programming #set #using: Sharing Analysis Using Set Logic Programs (FB, MC, VL), p. 417.
ICLP-1997-Codish #bottom-up #evaluation #logic programming #performance: Efficient Goal Directed Bottom-up Evaluation of Logic Programs (MC), p. 422.
ICLP-1997-DebrayGH #analysis #logic programming: Non-Failure Analysis for Logic Programs (SKD, PLG, MVH), pp. 48–62.
ICLP-1997-DecorteS #analysis #automation #constraints #logic programming: Demand-Driven and Constraint-Based Automatic Left-Termination Analysis for Logic Programs (SD, DDS), pp. 78–92.
ICLP-1997-DekhtyarS #hybrid #probability: Hybrid Probabilistic Programs (AD, VSS), pp. 391–405.
ICLP-1997-LindenstraussS #analysis #automation #logic programming #termination: Automatic Termination Analysis of Logic Programs (NL, YS), pp. 63–77.
ICLP-1997-PontelliGPF #automation #parallel #prolog: Automatic Compile-time Parallelization of Prolog Programs for Dependent And-Parallelism (EP, GG, FP, AF), pp. 108–122.
ICLP-1997-PueblaBMS #logic programming #optimisation #scheduling: Optimization of Logic Programs with Dynamic Scheduling (GP, MJGdlB, KM, PJS), pp. 93–107.
ICLP-1997-Raamsdonk #logic programming #term rewriting: Translating Logic Programs into Conditional Rewriting Systems (FvR), pp. 168–182.
ICLP-1997-SmausHK #analysis #logic programming: Domain Construction for Mode Analysis of Typed Logic Programs (JGS, PMH, AK), p. 418.
ICLP-1997-VaupelGP #execution #logic programming #visualisation: Visualization of And/Or-Parallel Execution of Logic Programs (RV, EP, GG), pp. 271–285.
ILPS-1997-DebrayLHL #bound #estimation #logic programming: Lower Bound Cost Estimation for Logic Programs (SKD, PLG, MVH, NWL), pp. 291–305.
ILPS-1997-Grosof #logic programming: Prioritized Conflict Handling for Logic Programs (BNG), pp. 197–211.
ILPS-1997-KingSB #analysis #bound #logic programming: Lower-bound Time-complexity Analysis of Logic Programs (AK, KS, FB), pp. 261–275.
ILPS-1997-Podelski #analysis #logic programming: Set-Based Analysis of Logic Programs and Reactive Logic Programs (AP), pp. 35–36.
ILPS-1997-TanL #analysis #logic programming #precise #recursion: Recursive Modes for Precise Analysis of Logic Programs (JT, IPL), pp. 277–290.
ILPS-1997-VerbaetenDS #composition #logic programming: Compositionality of Normal Open Logic Programs (SV, MD, DDS), pp. 371–385.
ILPS-1997-ZhangF #logic programming #set: Answer Sets for Prioritized Logic Programs (YZ, NYF), pp. 69–83.
ITiCSE-1996-Jimenez-PerisPPV #evaluation #functional #visual notation #visualisation: Graphical visualization of the evaluation of functional programs (RJP, CPF, MPM, JÁVI), pp. 36–38.
ITiCSE-1996-Nadi #simulation: Simulation programs for studying computer organization (NN), p. 233.
ITiCSE-1996-Roberts #tool support: Tools for creating portable demonstration programs (ER), pp. 78–80.
ICSM-1996-BurdMW #cobol #reuse #scalability: Analysing Large COBOL Programs: the extraction of reusable modules (EB, MM, CDW), pp. 238–243.
ICSM-1996-GannodC #c #reverse engineering #using: Using Informal and Formal Techniques for the Reverse Engineering of C Programs (GCG, BHCC), pp. 265–274.
ICSM-1996-YoungerLBB #analysis #concurrent #formal method #modelling #reverse engineering #using: Reverse Engineering Concurrent Programs using Formal Modelling and Analysis (EJY, ZL, KHB, TMB), pp. 255–264.
WCRE-1996-GannodC #c #reverse engineering #using: Using Informal and Formal Techniques for the Reverse Engineering of C Programs (GCG, BHCC), pp. 249–258.
WCRE-1996-LakeB #approach #assembly #logic #modelling #reverse engineering: Reverse Engineering of Assembler Programs: A Model-Based Approach and its Logical Basis (TL, TB), pp. 67–75.
WCRE-1996-YoungerLBB #analysis #concurrent #formal method #modelling #reverse engineering #using: Reverse Engineering Concurrent Programs Using Formal Modelling and Analysis (EJY, ZL, KHB, TMB), pp. 239–248.
WPC-1996-SneedE: Extracting Business Rules from Source Code (HMS, KE), p. 240–?.
ICALP-1996-AblayevK #branch #on the #power of #random: On the Power of Randomized Branching Programs (FMA, MK), pp. 348–356.
ICALP-1996-CowenFK #framework #heuristic: A Formal Framework for Evaluating Heuristic Programs (LC, JF, SK), pp. 634–645.
WIA-1996-RavikumarX #implementation #parallel #problem #sequence: Implementing Sequential and Parallel Programs for the Homing Sequence Problem (BR, XX), pp. 120–131.
ICFP-1996-JonesPS #float #named #performance: Let-floating: Moving Bindings to Give Faster Programs (SLPJ, WP, AS), pp. 1–12.
IFL-1996-DebbabiFT #algorithm #analysis #concurrent #control flow #higher-order #type system: A Type-Based Algorithm for the Control-Flow Analysis of Higher-Order Concurrent Programs (MD, AF, NT), pp. 247–266.
IFL-1996-JarvisM #functional #lazy evaluation #profiling #scalability: The Results of: Profiling Large-Scale Lazy Functional Programs (SAJ, RGM), pp. 200–221.
CIKM-1996-EhrmanntrautHWS #towards: The Personal Electronic Program Guide — Towards the Pre-Selection of Individual TV Programs (ME, TH, HW, RS), pp. 243–250.
ICML-1996-Bostrom #induction #logic programming #regular expression: Theory-Guideed Induction of Logic Programs by Inference of Regular Languages (HB), pp. 46–53.
ICML-1996-JappyNG #horn clause #learning #robust: Negative Robust Learning Results from Horn Clause Programs (PJ, RN, OG), pp. 258–265.
ICPR-1996-BiancardiM #analysis #component #image: Connected component support for image analysis programs (AB, AM), pp. 620–624.
KR-1996-BrassDP #logic programming: Super Logic Programs (SB, JD, TCP), pp. 529–540.
SEKE-1996-Balmas96a #formal method #named #programming: PRISME: Formalizing Programming Strategies as a Way to Understand Programs (FB), pp. 361–368.
SEKE-1996-LiaoCSC #object-oriented #specification #testing: Testing Object-Oriented Programs Based on Usage Profiles and Formal Specifications (SSL, KHC, SBS, CYC), pp. 9–16.
ECOOP-1996-AignerH #c++: Eliminating Virtual Function Calls in C++ Programs (GA, UH), pp. 142–166.
OOPSLA-1996-DiwanMM #analysis #effectiveness #object-oriented #static typing: Simple and Effective Analysis of Statically Typed Object-Oriented Programs (AD, JEBM, KSM), pp. 292–305.
AdaEurope-1996-ChengU #ada #detection: Tasking Deadlocks in Ada 95 Programs and Their Detection (JC, KU), pp. 135–146.
AdaEurope-1996-KruchtenT #ada #development #scalability: Iterative Software Development for Large Ada Programs (PK, CJT), pp. 101–110.
AdaEurope-1996-Madhav #ada #architecture #consistency #testing: Testing Ada 95 Programs for Conformance to Rapide Architectures (NM), pp. 123–134.
ALP-1996-FagesG #constraints #logic programming #semantics: A Hierarchy of Semantics for Normal Constraint Logic Programs (FF, RG), pp. 77–91.
LOPSTR-1996-BrogiC #composition #logic programming: Specialising Meta-level Compositions of Logic Programs (AB, SC), pp. 275–294.
LOPSTR-1996-Brunekreef #prolog: A Transformation Tool for Pure Prolog Programs (JB), pp. 130–145.
LOPSTR-1996-CortesiCR #automation #prolog #verification: Specification-Based Automatic Verification of Prolog Programs (AC, BLC, SR), pp. 38–57.
LOPSTR-1996-FribourgO #logic programming #petri net #reduction: Reductions of Petri Nets and Unfolding of Propositional Logic Programs (LF, HO), pp. 187–203.
LOPSTR-1996-HayesNS #logic programming #specification: Refining Specifications to Logic Programs (IJH, RGN, PAS), pp. 1–19.
LOPSTR-1996-LeuschelS96a #logic programming: Redundant Argument Filtering of Logic Programs (ML, MHS), pp. 83–103.
LOPSTR-1996-MartinKS #logic programming: Typed Norms for Typed Logic Programs (JCM, AK, PS), pp. 224–238.
LOPSTR-1996-MatskinKK #deduction #framework #synthesis: Partial Deduction in the Framework of Structural Synthesis of Programs (MM, HJK, JK), pp. 239–255.
PLDI-1996-Adl-TabatabaiLLW #independence #mobile #performance: Efficient and Language-Independent Mobile Programs (ARAT, GL, SL, RW), pp. 127–136.
PLDI-1996-BaileyD #generative #sequence: Target-Sensitive Construction of Diagnostic Programs for Procedure Calling Sequence Generators (MWB, JWD), pp. 249–257.
PLILP-1996-Fecht #logic programming #performance #precise: An Efficient and Precise Sharing Domain for Logic Programs (CF), pp. 469–470.
PLILP-1996-FreireSW #logic programming #scheduling: Beyond Depth-First: Improving Tabled Logic Programs through Alternative Scheduling Strategies (JF, TS, DSW), pp. 243–258.
PLILP-1996-Lucas #confluence: Context-Sensitive Computations in Confluent Programs (SL), pp. 408–422.
PLILP-1996-PueblaH #automation #logic programming #optimisation #scheduling: Automatic Optimization of Dynamic Scheduling in Logic Programs (GP, MVH), pp. 475–476.
POPL-1996-FegarasS #data type #embedded #morphism: Revisiting Catamorphisms over Datatypes with Embedded Functions (or, Programs from Outer Space) (LF, TS), pp. 284–294.
POPL-1996-GuptaS #static analysis: Static Analysis to Reduce Synchronization Costs in Data-Parallel Programs (MG, ES), pp. 322–332.
SAS-1996-AlstrupLT: Generalized Dominators for Structured Programs (SA, PWL, MT), pp. 42–51.
SAS-1996-BoerGP #constraints #correctness #logic programming #proving #scheduling: Proving Correctness of Constraint Logic Programs with Dynamic Scheduling (FSdB, MG, CP), pp. 83–97.
SAS-1996-BruynoogheDBDM #analysis #logic programming: A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation (MB, BD, DB, MD, AM), pp. 128–142.
SAS-1996-KellyMSS #analysis #constraints #incremental #logic programming: Two Applications of an Incremental Analysis Engine for (Constraint) Logic Programs (ADK, KM, HS, PJS), pp. 385–386.
SAS-1996-MullerGS #automation #composition #prolog #proving #termination: Automated Modular Termination Proofs for Real Prolog Programs (MM, TG, KS), pp. 220–237.
SAS-1996-PueblaH #algorithm #analysis #incremental #logic programming: Optimized Algorithms for Incremental Analysis of Logic Programs (GP, MVH), pp. 270–284.
SAS-1996-Venet #alias #analysis: Abstract Cofibered Domains: Application to the Alias Analysis of Untyped Programs (AV), pp. 366–382.
ICSE-1996-KoskimiesM #diagrams #named #object-oriented #using: Scene: Using Scenario Diagrams and Active Text for Illustrating Object-Oriented Programs (KK, HM), pp. 366–375.
KBSE-1996-EllmanM #algebra #deduction #difference #equation #network #simulation #synthesis: Deductive Synthesis of Numerical Simulation Programs from Networks of Algebraic and Ordinary Differential Equations (TE, TM), p. 5.
KBSE-1996-HarmerMB #cobol #knowledge-based #using: Using Knowledge-Based Transformations to Reverse-Engineer COBOL Programs (TJH, PJM, JMB), p. 17.
KBSE-1996-KeaneE #automation #design #knowledge-based #legacy #re-engineering #robust: Knowledge-Based Re-engineering of Legacy Programs for Robustness in Automated Design (JK, TE), p. 16.
SAC-1996-RajePG #analysis #named #object-oriented: OFFERS — a tool for hierarchical implicit analysis of sequential object-oriented programs (RRR, DP, ETG), pp. 437–441.
ASPLOS-1996-HuangS #requirements: The Intrinsic Bandwidth Requirements of Ordinary Programs (ASH, JPS), pp. 105–114.
CC-1996-Steensgaard #analysis #points-to #type inference: Points-to Analysis by Type Inference of Programs with Structures and Unions (BS), pp. 136–150.
HPDC-1996-KimP #distributed #framework: A Source-Level Transformation Framework for RPC-Based Distributed Programs (THK, JMP), pp. 78–87.
PDP-1996-FagotK #assessment #parallel: Systematic Assessment of the Overhead of Tracing Parallel Programs (AF, JCdK), pp. 178–186.
PDP-1996-KamkarKF #message passing #parallel #slicing: Dynamic Slicing of Parallel Message-Passing Programs (MK, PK, PF), pp. 170–178.
PDP-1996-KrawczykW #object-oriented #parallel: Object-Oriented Model of Parallel Programs (HK, BW), pp. 80–86.
PDP-1996-MassariM #automation #performance: Performance Evualuation of Automatically Generated Data-Parallel Programs (LM, YM), pp. 534–540.
PDP-1996-Roegel #concurrent #object-oriented #specification: Specifying Almost-Real Concurrent Object-Oriented Programs (DR), pp. 94–101.
PDP-1996-Vernier-Mounier #parallel #symbolic computation #symmetry: Symbolic Executions of Symmetrical Parallel Programs (IVM), pp. 327–335.
ESOP-1996-AlpuenteFV #functional #logic programming #partial evaluation: Narrowing-Driven Partial Evaluation of Functional Logic Programs (MA, MF, GV), pp. 45–61.
ESOP-1996-BuenoGHP #analysis #prolog #standard: Global Analysis of Standard Prolog Programs (FB, DCG, MVH, GP), pp. 108–124.
ESOP-1996-PalsbergPL #adaptation #approach #compilation: A New Approach to Compiling Adaptive Programs (JP, BPS, KJL), pp. 280–295.
ESOP-1996-RohwedderP #higher-order #logic programming #termination: Mode and Termination Checking for Higher-Order Logic Programs (ER, FP), pp. 296–310.
STOC-1996-BabaiGKRSW #bound #graph: Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs (LB, AG, JK, LR, TS, AW), pp. 603–611.
STOC-1996-KleinL #algorithm #approximate #performance: Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING (PNK, HIL), pp. 338–347.
CADE-1996-SagonasSW #automaton: An Abstract Machine for Fixed-Order Dynamically Stratified Programs (KFS, TS, DSW), pp. 328–342.
ISSTA-1996-ChamillardC #analysis #concurrent #petri net: Improving the Accuracy of Petri Net-Based Analysis of Concurrent Programs (ATC, LAC), pp. 24–38.
ISSTA-1996-GodefroidPS #concurrent #industrial #partial order #using #validation: Using Partial-Order Methods in the Formal Validation of Industrial Concurrent Programs (PG, DP, MGS), pp. 261–269.
ISSTA-1996-HughesS #algebra #named #object-oriented #testing: Daistish: Systematic Algebraic Testing for OO Programs in the Presence of Side-effects (MH, PDS), pp. 53–61.
ISSTA-1996-Korel #automation #generative #testing: Automated Test Data Generation for Programs with Procedures (BK), pp. 209–215.
JICSLP-1996-Bry #composition #database #deduction #logic programming #semantics: A Compositional Semantics for Logic Programs and Deductive Databases (FB), pp. 453–467.
JICSLP-1996-ChoU #concurrent #logic programming: Diagnosing Non-Well-Moded Concurrent Logic Programs (KC, KU), pp. 215–229.
JICSLP-1996-EtalleT #composition #semantics: A Compositional Semantics for Normal Open Programs (SE, FT), pp. 468–482.
JICSLP-1996-FalaschiHW #analysis #concurrent #constraints: Demand Transformation Analysis for Concurrent Constraint Programs (MF, PH, WHW), pp. 333–347.
JICSLP-1996-Mesnard #constraints #logic programming #query: Inferring Left-terminating Classes of Queries for Constraint Logic Programs (FM), pp. 7–21.
JICSLP-1996-Pradhan #logic programming: Logic Programs with Contested Information (SP), pp. 423–437.
JICSLP-1996-SakamaI #logic programming #representation: Representing Priorities in Logic Programs (CS, KI), pp. 82–96.
JICSLP-1996-TanL #logic programming #synthesis: Type Synthesis for Logic Programs (JT, IPL), pp. 200–214.
JICSLP-1996-Thielscher #logic programming #proving #semantics: A Nonmonotonic Disputation-Based Semantics and Proof Procedure for Logic Programs (MT), pp. 483–497.
LICS-1996-Pradhan #logic programming #semantics: Semantics of Normal Logic Programs and Contested Information (SP), pp. 406–415.
PODS-1995-LevyS #datalog #optimisation #query #semantics: Semantic Query Optimization in Datalog Programs (AYL, YS), pp. 163–173.
PODS-1995-Wood: Magic Factoring of Closure Programs (PTW), pp. 174–183.
FPLE-1995-Fokker #algebra #functional: Explaining Algebraic Theory with Functional Programs (JF), pp. 139–158.
ICSM-1995-KamkarK #distributed #slicing: Dynamic slicing of distributed programs (MK, PK), p. 222–?.
ICSM-1995-PearseO #industrial #maintenance #metric #process: Maintainability measurements on industrial source code maintenance activities (TTP, PWO), pp. 295–303.
WCRE-1995-GallK #approach: Finding Objects in Procedural Programs: An Alternative Approach (HG, RK), pp. 208–216.
WCRE-1995-HarrisYR #architecture: Recognizers for Extracting Architectural Features from Source Code (DRH, ASY, HBR).
WCRE-1995-NewcombM #data flow #re-engineering: Reengineering Procedural into Data Flow Programs (PN, PM).
WCRE-1995-SneedN #object-oriented #specification: Extracting Object-Oriented Specification from Procedurally Oriented Programs (HMS, EN).
ICALP-1995-GrecoSZ #automaton #logic programming: The PushDown Method to Optimize Chain Logic Programs (SG, DS, CZ), pp. 523–534.
RTA-1995-AnantharamanR #logic programming: A Rewrite Mechanism for Logic Programs with Negation (SA, GR), pp. 163–178.
RTA-1995-ChazarainM #automation #equation #named #recursion #synthesis: LEMMA: A System for Automated Synthesis of Recursive Programs in Equational Theories (JC, SM), pp. 420–425.
AFP-1995-EekelenP95 #functional #performance: Constructing Medium Sized Efficient Functional Programs in Clean (MCJDvE, MJP), pp. 183–227.
FPCA-1995-GoncalvesA #performance: Cache Performance of Fast-Allocating Programs (MJRG, AWA), pp. 293–305.
FPCA-1995-JeuringS #analysis #functional #problem: Constructing Functional Programs for Grammar Analysis Problems (JJ, SDS), pp. 259–269.
FPCA-1995-QuintonRW #functional #imperative: Deriving Imperative Code from Functional Programs (PQ, SVR, DW), pp. 36–44.
FPCA-1995-SchauserG #how #question #strict: How Much Non-Strictness do Lenient Programs Require? (KES, SCG), pp. 216–225.
CIKM-1995-SoparkarKJA #database #parallel #runtime: Run-Time Parallelization of Sequential Database Programs (NS, PK, HVJ, AA), pp. 74–81.
SEKE-1995-Balmas #comprehension: Classifying Programs: a Key For program Understanding (FB), pp. 342–349.
SEKE-1995-Lee #execution #logic programming #parallel: Parallel Execution of Logic Programs with Breadth-first Search (WSL), pp. 470–477.
ECOOP-1995-DeanGC #analysis #object-oriented #optimisation #using: Optimization of Object-Oriented Programs Using Static Class Hierarchy Analysis (JD, DG, CC), pp. 77–101.
AdaEurope-1995-Barbey #ada #object-oriented #testing: Testing Ada 95 Object-Oriented Programs (SB), pp. 406–418.
LOPSTR-1995-Aarts #complexity: Complexity of Horn Programs (EA), pp. 76–90.
LOPSTR-1995-ArtsZ #logic programming #semantics #termination #unification #using: Termination of Logic Programs Using Semantic Unification (TA, HZ), pp. 219–233.
LOPSTR-1995-BossiCE #order #problem: Transformation of Left Terminating Programs: the Reordering Problem (AB, NC, SE), pp. 33–45.
LOPSTR-1995-Hanus #functional #lazy evaluation #logic programming #performance #prolog: Efficient Translation of Lazy Functional Logic Programs into Prolog (MH), pp. 252–266.
LOPSTR-1995-LauO #deduction #logic programming #object-oriented #synthesis #towards: Towards an Object-Oriented Methodology for Deductive Synthesis of Logic Programs (KKL, MO), pp. 152–169.
LOPSTR-1995-Mesnard #automation #towards: Towards Automatic Control for CLP(x) Programs (FM), pp. 106–119.
LOPSTR-1995-Renault #logic programming #proving #towards: Towards a Complete Proof Procedure to Prove Properties of Normal Logic Programs under the Completion (SR), pp. 204–218.
LOPSTR-1995-SemeraroEM #datalog #refinement: Ideal Refinement of Datalog Programs (GS, FE, DM), pp. 120–136.
PEPM-1995-Colby #communication #concurrent: Analyzing the Communication Topology of Concurrent Programs (CC), pp. 202–213.
PEPM-1995-DasRH #analysis #imperative #semantics: Semantic Foundations of Binding Time Analysis for Imperative Programs (MD, TWR, PVH), pp. 100–110.
PEPM-1995-Jensen #analysis #data flow: Clock Analysis of Synchronous Dataflow Programs (TPJ), pp. 156–167.
PEPM-1995-Lu #analysis #logic programming: Type Analysis of Logic Programs in the Presence of Type Definitions (LL), pp. 241–252.
PEPM-1995-Metayer #data type #proving #recursion: Proving Properties of Programs Defined over Recursive Data Structures (DLM), pp. 88–99.
PEPM-1995-PueblaH #implementation #logic programming #multi: Implementation of Multiple Specialization in Logic Programs (GP, MVH), pp. 77–87.
PEPM-1995-RamakrishnanRS #analysis #constraints #framework #logic programming #theorem proving: A Symbolic Constraint Solving Framework for Analysis of Logic Programs (CRR, IVR, RCS), pp. 12–23.
PLDI-1995-Fernandez #effectiveness #optimisation: Simple and Effective Link-Time Optimization of Modula-3 Programs (MFF), pp. 103–115.
PLDI-1995-KrishnamurthyY #optimisation #parallel: Optimizing Parallel Programs with Explicit Synchronization (AK, KAY), pp. 196–204.
PLDI-1995-WilsonL #analysis #c #performance #pointer: Efficient Context-Sensitive Pointer Analysis for C Programs (RPW, MSL), p. 1–?.
PLILP-1995-Achten #framework #functional #interactive: A Functional Framework for Deterministically Interleaved Interactive Programs (PA), pp. 451–452.
PLILP-1995-ColussiMM #constraints #data flow #logic programming #semantics: A Dataflow Semantics for Constraint Logic Programs (LC, EM, MM), pp. 431–448.
PLILP-1995-DawsonRR #design #implementation #logic programming #performance: Design and Implementation of Jump Tables for Fast Indexing of Logic Programs (SD, CRR, IVR), pp. 133–150.
PLILP-1995-SaglamG #approximate #constraints #logic programming #polymorphism #using: Approximating Constraint Logic Programs Using Polymorphic Types and Regular Descriptions (HS, JPG), pp. 461–462.
POPL-1995-DawsonRRSSSW #execution #logic programming #performance #unification: Unification Factoring for Efficient Execution of Logic Programs (SD, CRR, IVR, KFS, SS, TS, DSW), pp. 247–258.
POPL-1995-SchauserCG #algorithm #clustering #constraints #strict #thread: Separation Constraint Partitioning — A New Algorithm for Partitioning Non-strict Programs into Sequential Threads (KES, DEC, SCG), pp. 259–271.
SAS-1995-Colby #concurrent: Determining Storage Properties of Sequential and Concurrent Programs with Assignment and Structured Data (CC), pp. 64–81.
SAS-1995-Faxen #functional #lazy evaluation #optimisation #using: Optimizing Lazy Functional Programs Using Flow Inference (KFF), pp. 136–153.
SAS-1995-Giesl #analysis #functional #order #termination #using: Termination Analysis for Functional Programs using Term Orderings (JG), pp. 154–171.
SAS-1995-RaoS #execution #prolog: Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs (MRKKR, RKS), pp. 243–260.
TRI-Ada-1995-Bardin #ada #concurrent #implementation: Implementing Concurrent Programs in Ada 95 (BMB), pp. 557–654.
ESEC-1995-TaiC #concurrent #testing: A Specification-Based Methology for Testing Concurrent Programs (KCT, RHC), pp. 154–172.
ICSE-1995-DwyerCN #concurrent #petri net #representation: A Compact Petri Net Representation for Concurrent Programs (MBD, LAC, KAN), pp. 147–157.
KBSE-1995-Liu #incremental #interactive #named #program transformation: CACHET: An Interactive, Incremental-Attribution-Based Program Transformation System for Deriving Incremental Programs (YAL), pp. 19–26.
KBSE-1995-Richardson #automation #data type #functional: Automating Changes of Data Type in Functional Programs (JR), pp. 166–173.
SAC-1995-BanachP #behaviour #graph grammar #linear: Linear behaviour of term graph rewriting programs (RB, GAP), pp. 157–163.
SAC-1995-GarrettOK #visual notation: Scripting of event driven programs for graphical, computer-based laboratories (DAG, MBO, BLK), pp. 17–21.
SAC-1995-TarngYR: A digital conference like software tool for PDP programs (JJT, QY, KDR), pp. 406–410.
SAC-1995-WassermanYS #logic programming: An alternative transformation rule for logic programs (HCW, KY, ZS), pp. 364–368.
ASF+SDF-1995-Heering #algebra #imperative: An Algebraic Machine for Imperative Programs (JH), pp. 27–28.
DAC-1995-ChiodoGJLHSSS #embedded #synthesis: Synthesis of Software Programs for Embedded Control Applications (MC, PG, AJ, LL, HH, KS, ALSV, ES), pp. 587–592.
LCT-RTS-1995-BakkersSP #automation #communication #generative #parallel #realtime #scheduling: Automatic Generation of Scheduling and Communication Code in Real-Time Parallel Programs (AB, JS, EP), pp. 134–145.
PDP-1995-AudenaertL #concurrent #detection #graph #parallel #performance: Space efficient data race detection for parallel programs with series-parallel task graphs (KA, LL), pp. 508–515.
PDP-1995-CoscasFL #modelling #using: Modelling actor programs using Predicate/Transition nets (PC, GF, AL), pp. 199–200.
PDP-1995-SchieferS #named #parallel #visualisation: VIPER: a tool for the visualisation of parallel programs (RS, PvdS), pp. 540–546.
PPoPP-1995-BordawekarCKKP #compilation #parallel: A Model and Compilation Strategy for Out-of-Core Data Parallel Programs (RB, ANC, KK, CK, MHP), pp. 1–10.
PPoPP-1995-HwangLJ #array #fortran #synthesis: An Array Operation Synthesis Scheme to Optimize Fortran 90 Programs (GHH, JKL, RDCJ), pp. 112–122.
PPoPP-1995-KennedyNS #algorithm #linear #memory management #sequence: A Linear-Time Algorithm for Computing the Memory Access Sequence in Data-Parallel Programs (KK, NN, AS), pp. 102–111.
STOC-1995-Ponzio #bound #branch #integer #multi: A lower bound for integer multiplication with read-once branching programs (SP), pp. 130–139.
CAV-1995-JagadeesanPO #safety #verification: Safety Property Verification of ESTEREL Programs and Applications to Telecommunications Software (LJJ, CP, JVO), pp. 127–140.
CAV-1995-Lescow #finite #game studies #on the: On Polynomial-Size Programs Winning Finite-State Games (HL), pp. 239–252.
ICLP-1995-Beierle #logic programming #order #polymorphism: Type Inferencing for Polymorphic Order-Sorted Logic Programs (CB), pp. 765–779.
ICLP-1995-ChengPE #equation #implementation #logic programming: A Method for Implementing Equational Theories as Logic Programs (MHMC, DSPJ, MHvE), pp. 497–511.
ICLP-1995-EtalleG #composition: A Transformation System for Modular CLP Programs (SE, MG), pp. 681–695.
ICLP-1995-HermenegildoPMS #analysis #incremental #logic programming: Incremental Analysis of Logic Programs (MVH, GP, KM, PJS), pp. 797–811.
ICLP-1995-IsozakiK #estimation #execution #logic programming #transaction: Transformation of Transaction Logic Programs based on Estimation of Transaction Execution Paths (HI, HK), p. 822.
ICLP-1995-Jain #logic programming #using: Projections of Logic Programs using Symbol Mappings (AJ), pp. 483–496.
ICLP-1995-NilssonH #higher-order #logic programming: Constructing Logic Programs with Higher-Order Predicates (JFN, AH), p. 827.
ICLP-1995-PodelskiS #constraints #logic programming #semantics: Operational Semantics of Constraint Logic Programs with Coroutining (AP, GS), pp. 449–463.
ICLP-1995-RamakrishnanRSSW #logic programming #performance: Efficient Tabling Mechanisms for Logic Programs (IVR, PR, KFS, TS, DSW), pp. 697–711.
ICLP-1995-Sato #learning #logic programming #semantics #statistics: A Statistical Learning Method for Logic Programs with Distribution Semantics (TS), pp. 715–729.
ICLP-1995-TanL #logic programming #synthesis: Type Synthesis for Logic Programs (JT, IPL), p. 823.
ICLP-1995-ToniK #abduction #logic programming #reduction: Reduction of Abductive Logic Programs to Normal Logic Programs (FT, RAK), pp. 367–381.
ICLP-1995-ZhaoCU #analysis #concurrent #dependence #logic programming: Program Dependence Analysis of Concurrent Logic Programs and Its Applications (JZ, JC, KU), p. 825.
ILPS-1995-BandaMS #analysis #logic programming #performance #scheduling: Efficient Analysis of Logic Programs with Dynamic Scheduling (MJGdlB, KM, PJS), pp. 417–431.
ILPS-1995-FerrandL #composition #correctness #logic programming #proving: A Compositional Proof Method of Partial Correctness for Normal Logic Programs (GF, AL), pp. 209–223.
ILPS-1995-GallagherBS #logic programming #modelling #static analysis: Practical Model-Based Static Analysis for Definite Logic Programs (JPG, DB, HS), pp. 351–365.
ILPS-1995-Gurr #declarative #logic programming: Declarative Annotations for Logic Programs (CAG), p. 639.
ILPS-1995-JanssensBD #abstract interpretation #automaton #constraints #logic programming: A Blueprint for an Abstract Machine for Abstract Interpretation of (Constraint) Logic Programs (GJ, MB, VD), pp. 336–350.
ILPS-1995-LauO #approach #constraints #deduction #formal method #logic programming #synthesis: A Formal Approach to Deductive Synthesis of Constraint Logic Programs (KKL, MO), pp. 543–557.
ILPS-1995-MalfonF #approach #semantics: Type Correct programs: A semantic approach (BM, GF), pp. 576–590.
ILPS-1995-MarchioriT #logic programming #proving #termination: Proving Termination of Logic Programs with Delay Declarations (EM, FT), pp. 447–461.
ILPS-1995-MessingS #logic programming: Regular Signed Resolution Applied to Annotated Logic Programs (BM, PvS), p. 638.
ILPS-1995-YouGYG #framework #logic programming: An Introspective Framework for Paraconsistent Logic Programs (JHY, SG, LYY, RG), pp. 384–398.
PODS-1994-ChaudhuriV #complexity #datalog #equivalence #on the #recursion: On the Complexity of Equivalence between Recursive and Nonrecursive Datalog Programs (SC, MYV), pp. 107–116.
PODS-1994-Sohn #constraints #logic programming: Constraints among Argument Sizes in Logic Programs (KS), pp. 68–74.
CSEE-1994-AmmannGORS #re-engineering: A Five Year Perspective on Software Engineering Graduate Programs at George Mason University (PA, HG, AJO, DR, BS), pp. 473–488.
ICSM-1994-AngerRY #concurrent #dynamic analysis: Combining Static and Dynamic Analysis of Concurrent Programs (FDA, RVR, MY), pp. 89–98.
ICSM-1994-KinlochM #c #comprehension #graph #representation #using: Understanding C Programs Using the Combined C Graph Representation (DAK, MM), pp. 172–180.
ICSM-1994-PaulP #algebra #query #using: Querying Source Code Using an Algebraic Query Language (SP, AP), pp. 127–136.
ICSM-1994-YangB #data-driven #maintenance: Extension of a Transformation System for Maintenance: Dealing with Data-Intensive Programs (HY, KHB), pp. 344–353.
ICALP-1994-AbdullaJ #decidability #problem #verification: Undecidable Verification Problems for Programs with Unreliable Channels (PAA, BJ), pp. 316–327.
ICALP-1994-FixS #reasoning: Reasoning about Programs by Exploiting the Environment (LF, FBS), pp. 328–339.
FME-1994-Barros #database #relational #specification: Deriving Relational Database Programs from Formal Specifications (RSMdB), pp. 703–723.
LFP-1994-Heintze #analysis #ml: Set-Based Analysis of ML Programs (NH), pp. 306–317.
LFP-1994-StefanescuZ #analysis #equation #framework #functional #higher-order: An Equational Framework for the Flow Analysis of Higher Order Functional Programs (DCS, YZ), pp. 318–327.
TAGT-1994-Wills #graph #parsing #using: Using Attributed Flow Graph Parsing to Recognize Clichés in Programs (LMW), pp. 170–184.
CIKM-1994-ChenH #algorithm #graph #linear #traversal: An Optimal Graph Traversal Algorithm for Evaluating Linear Binary-Chain Programs (YC, TH), pp. 34–41.
KDD-1994-Kiselev #functional #named: PolyAnalyst — A Machine Discovery System Inferring Functional Programs (MVK), pp. 237–250.
SEKE-1994-ArndtGPT #execution #logic programming #symbolic computation: Symbolic execution of logic programs (TA, AG, GP, GT), pp. 414–421.
SEKE-1994-AzemB #prolog #reliability: Reliability determination of Prolog programs (AA, FB), pp. 422–429.
SEKE-1994-CookeDGK #concurrent #linear #logic programming: Bag languages, concurrency, Horn logic programs, and linear logic (DEC, RD, AQG, VK), pp. 289–297.
AdaEurope-1994-Doeuff #ada #automation #generative: Automatic Generation of Ada Source Code for the Rafale Mission Computer (HLD), pp. 333–348.
AdaEurope-1994-GerlichW #ada: Tuning Ada Programs in Advance (RG, UW), pp. 440–464.
ALP-1994-AlpuenteFV #analysis #composition #equation: Compositional Analysis for Equational Horn Programs (MA, MF, GV), pp. 77–94.
ALP-1994-BuenoHMR #concurrent #semantics: From Eventual to Atomic Locally Atomic CC Programs: A Concurrent Semantics (FB, MVH, UM, FR), pp. 114–132.
ALP-1994-Marchiori #logic programming #term rewriting: Logic Programs as term Rewriting Systems (MM), pp. 223–241.
ALP-1994-Marchiori94a #alias #logic programming: A Logic for Variable Aliasing in Logic Programs (EM), pp. 287–304.
ALP-1994-Miller #logic programming #multi #specification #using: Specifications Using Multiple-Conclusion Logic Programs (DM), pp. 3–4.
ALP-1994-Teusink #abduction #logic programming: Three-Valued Completion for Abductive Logic Programs (FT), pp. 150–167.
LOPSTR-1994-Basin #framework #logic programming: Logic Frameworks for Logic Programs (DAB), pp. 1–16.
LOPSTR-1994-BensaouG: An Extended Transformation System for CLP Programs (NB, IG), pp. 17–35.
LOPSTR-1994-BossiE #semantics: More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting’s Semantics (AB, SE), pp. 311–331.
LOPSTR-1994-BrogiC #logic programming #metalanguage: Gödel as a Meta-Language for Composing Logic Programs (AB, SC), pp. 377–394.
LOPSTR-1994-CookG #analysis #termination: A Transformation System for Definite Programs Based on Termination Analysis (JC, JPG), pp. 51–68.
LOPSTR-1994-Dunin-Keplicz #architecture #development #multi: An Architecture with Multiple Meta-Levels for the Development of Correct Programs (BDK), pp. 293–310.
LOPSTR-1994-GilbertHZ #behaviour #specification: Transforming Specifications of Observable Behaviour into Programs (DRG, CJH, JZ), pp. 88–103.
LOPSTR-1994-LauO #deduction #framework #logic programming #on the #specification #synthesis: On Specification Frameworks and Deductive Synthesis of Logic Programs (KKL, MO), pp. 104–121.
LOPSTR-1994-MarakakisG #data type #design #logic programming #top-down #using: Schema-Based Top-Down Design of Logic Programs Using Abstract Data Types (EIM, JPG), pp. 138–153.
LOPSTR-1994-Mircheva #logic programming #testing: Logic Programs with Tests (MM), pp. 276–292.
LOPSTR-1994-Renault #execution: Generalizing Extended Execution for Normal Programs (SR), pp. 154–169.
LOPSTR-1994-SakamaS #approach #declarative #deduction #logic programming: Partial Deduction of Disjunctive Logic Programs: A Declarative Approach (CS, HS), pp. 170–182.
LOPSTR-1994-SemeraroEMBP #case study #learning #logic: Avoiding Non-Termination when Learning Logical Programs: A Case Study with FOIL and FOCL (GS, FE, DM, CB, MJP), pp. 183–198.
PEPM-1994-BaierGZ #fortran #partial evaluation: Partial Evaluation of Numerical Programs in Fortran (RB, RG, RZ), pp. 119–132.
PEPM-1994-FegarasSZ #induction #multi: Improving Programs Which Recurse over Multiple Inductive Structures (LF, TS, TZ), pp. 21–32.
PLDI-1994-Agrawal #on the #slicing: On Slicing Programs with Jump Statements (HA), pp. 302–312.
PLDI-1994-NetzerW #debugging #incremental: Optimal Tracing and Incremental Reexecution for Debugging Long-Running Programs (RHBN, MHW), pp. 313–325.
PLDI-1994-Reinhold #garbage collection #performance: Cache Performance of Garbage-Collected Programs (MBR), pp. 206–217.
PLDI-1994-Wismuller #analysis #data flow #debugging #using: Debugging of Globally Optimized Programs Using Data Flow Analysis (RW), pp. 278–289.
PLILP-1994-Barklund: Tabulation of Functions in Definite Clause Programs (JB), pp. 465–466.
PLILP-1994-GergatsoulisK: Unfold/Fold Transformations For Definite Clause Programs (MG, MK), pp. 340–354.
PLILP-1994-Leal #prolog #visualisation: A System to Visualize and Interact with Prolog Programs (JPL), pp. 451–452.
PLILP-1994-Miller #logic programming #multi #specification #using: Specifications Using Multiple-Conclusion Logic Programs (DM), pp. 3–4.
POPL-1994-BoerGMP #concurrent #constraints #proving: Proving Concurrent Constraint Programs Correct (FSdB, MG, EM, CP), pp. 98–108.
POPL-1994-CalderG #c++: Reducing Indirect Function call Overhead in C++ Programs (BC, DG), pp. 397–408.
POPL-1994-DiwanTM #garbage collection #memory management #performance #using: Memory Subsystem Performance of Programs Using Copying Garbage Collection (AD, DT, JEBM), pp. 1–14.
POPL-1994-MarriottBH #logic programming #scheduling: Analyzing Logic Programs with Dynamic Scheduling (KM, MJGdlB, MVH), pp. 240–253.
POPL-1994-NielsonN #communication #concurrent #finite #higher-order: Higher-Order Concurrent Programs with Finite Communication Topology (HRN, FN), pp. 84–97.
POPL-1994-Paakki #execution #functional #logic programming #multi: Multi-Pass Execution of Functional Logic Programs (JP), pp. 361–374.
SAS-1994-AikenL #logic programming #type checking: Directional Type Checking of Logic Programs (AA, TKL), pp. 43–60.
SAS-1994-CodishD #dependence #logic programming #multi #polymorphism #using: Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop (MC, BD), pp. 281–296.
SAS-1994-DebrayGHL #logic programming: Estimating the Computational Cost of Logic Programs (SKD, PLG, MVH, NWL), pp. 255–265.
SAS-1994-HanusZ #analysis #functional #logic programming: Mode Analysis of Functional Logic Programs (MH, FZ), pp. 26–42.
SAS-1994-Yi #detection #exception #ml #standard: Compile-time Detection of Uncaught Exceptions in Standard ML Programs (KY), pp. 238–254.
FSE-1994-DwyerC #analysis #concurrent #data flow #verification: Data Flow Analysis for Verifying Properties of Concurrent Programs (MBD, LAC), pp. 62–75.
ICSE-1994-KroneS #on the: On the Inference of Configuration Structures from Source Code (MK, GS), pp. 49–57.
KBSE-1994-Balmas #concept #pattern matching: An Augmented Pattern Matcher as a Tool to Synthesize Conceptual Descriptions of Programs (FB), pp. 150–157.
KBSE-1994-MintonW #machine learning #using: Using Machine Learning to Synthesize Search Programs (SM, SRW), pp. 31–38.
SAC-1994-Bennet #distributed #message passing #parallel #runtime: Distributed message routing and run-time support for message-passing parallel programs derived from ordinary programs (TB), pp. 510–514.
SAC-1994-ChangCG #abstract interpretation #bottom-up #execution #logic programming: Abstract filters: improving bottom-up execution of logic programs by two-phase abstract interpretation (BMC, KMC, RG), pp. 388–393.
SAC-1994-GabbrielliG #analysis #logic programming: Goal independency and call patterns in the analysis of logic programs (MG, RG), pp. 394–399.
SAC-1994-GhazalO #constraints #query #termination: Termination of programs in constraint query languages (AG, AMO), pp. 266–270.
SAC-1994-Silva-Lepe #graph #object-oriented #specification: Abstracting graph-based specifications of object-oriented programs (ISL), pp. 447–451.
ASPLOS-1994-ChandraLR #message passing #question: Where is Time Spent in Message-Passing and Shared-Memory Programs? (SC, JRL, AR), pp. 61–73.
CC-1994-Hanus #functional #logic programming #optimisation #towards: Towards the Global Optimization of Functional Logic Programs (MH), pp. 68–82.
CC-1994-JanssensS #abstract interpretation #constraints #implementation #logic programming #on the: On the Implementation of Abstract Interpretation Systems for (Constraint) Logic Programs (GJ, WS), pp. 172–187.
HPDC-1994-EisenhauerSGM #interactive #named #online #parallel #towards: Falcon — Toward Interactive Parallel Programs: The On-line Steering of a Molecular Dynamics Application (GE, KS, WG, NM), pp. 26–33.
HPDC-1994-SiegellS #automation #generative #parallel: Automatic Generation of Parallel Programs with Dynamic Load Balancing (BSS, PS), pp. 166–175.
PDP-1994-Fahringer #benchmark #estimation #evaluation #fortran #metric #parallel #performance: Evaluation Of Benchmark Performance Estimation For Parallel Fortran Programs On Massively Parallel SIMD And MIMD Computers (TF), pp. 449–456.
PDP-1994-KalanteryWW #execution #parallel: Deterministic Parallel Execution Of Sequential Programs (NK, SCW, DRW), pp. 48–55.
PDP-1994-LevrouwAC #memory management: A New Trace And Replay System For Shared Memory Programs Based On Lamport Clocks (LL, KMRA, JMVC), pp. 471–478.
PDP-1994-McConnellMMM #analysis #migration #monitoring #parallel: Monitoring, Analysis And Tuning Of Parallel Programs Within The Fortport Migration Environment (RM, PM, JFM, PM), pp. 479–485.
PDP-1994-Siegle #markov #modelling #parallel #process: Reduced Markov Models Of Parallel Programs With Replicated Processes (MS), pp. 126–133.
ESOP-1994-Moreau #automaton #continuation #evaluation #functional #parallel: The PCKS-Machine: An Abstract Machine for Sound Evaluation of Parallel Functional Programs with First-Class Continuations (LM), pp. 424–438.
CADE-1994-FribourgP #bottom-up #constraints #datalog #evaluation: Bottom-up Evaluation of Datalog Programs with Arithmetic Constraints (LF, MVP), pp. 311–325.
ICLP-1994-BigotGD #logic programming: Output Value Placement in Moded Logic Programs (PAB, DG, SKD), pp. 175–189.
ICLP-1994-DixGM #logic programming #modelling: Causal Models of Disjunctive Logic Programs (JD, GG, VWM), pp. 290–302.
ICLP-1994-DixM #approach #axiom #semantics: An Axiomatic Approach to Semantics of Disjunctive Programs (JD, MM), pp. 303–320.
ICLP-1994-GallagherW #approximate #logic programming #performance #precise: Fast and Precise Regular Approximations of Logic Programs (JPG, DAdW), pp. 599–613.
ICLP-1994-GuptaHPC #execution #logic programming #named: ACE: And/Or-parallel Copying-based Execution of Logic Programs (GG, MVH, EP, VSC), pp. 93–109.
ICLP-1994-KakasMD #logic programming #semantics: The Acceptability Semantics for Logic Programs (ACK, PM, PMD), pp. 504–519.
ICLP-1994-LauOT #deduction #logic programming #problem #synthesis: The Halting Problem for Deductive Synthesis of Logic Programs (KKL, MO, SÅT), pp. 665–683.
ICLP-1994-LauW #logic programming #specification #synthesis #tutorial: A Tutorial on Synthesis of Logic Programs from Specifications (KKL, GAW), pp. 11–14.
ICLP-1994-LeachL #logic programming: Computing Annotated Logic Programs (SML, JJL), pp. 257–271.
ICLP-1994-McCainT #independence #logic programming: Language Independence and Language Tolerance in Logic Programs (NM, HT), pp. 38–57.
ICLP-1994-Mircheva #logic programming: Logic Programs with Refutation Rules (MM), p. 734.
ICLP-1994-Pedreschi #prolog #proving #runtime: A Proof Method for Runtime Properties of Prolog Programs (DP), pp. 584–598.
ICLP-1994-SakamaI #abduction #equivalence #logic programming #on the: On the Equivalence between Disjunctive and Abductive Logic Programs (CS, KI), pp. 489–503.
ILPS-1994-AlferesDP #named #top-down: SLX — A Top-down Derivation Procedure for Programs with Explicit Negation (JJA, CVD, LMP), pp. 424–438.
ILPS-1994-DebrayGB #detection #logic programming #optimisation: Detection and Optimization of Suspension-free Logic Programs (SKD, DG, PAB), pp. 487–501.
ILPS-1994-Giacobazzi #abduction #analysis #composition #logic programming: Abductive Analysis of Modular Logic Programs (RG), pp. 377–391.
ILPS-1994-Malfon #logic programming #semantics #validation: Characterization of Some Semantics for Logic Programs with Negation and Applications to Program Validation (BM), pp. 91–105.
ILPS-1994-MichaylovP #compilation #constraints #linear #logic programming #optimisation: Optimizing Compilation of Linear Arithmetic in a Class of Constraint Logic Programs (SM, BP), pp. 586–600.
ILPS-1994-OrosG #datalog #inheritance: Inferring Inheritance from Datalog Programs (MAO, PYG), p. 680.
ILPS-1994-RosenbluethP #logic programming #lr #parsing: LR Inference: Inference Systems for Fixed-Mode Logic Programs, Based on LR Parsing (DAR, JCP), pp. 439–453.
ILPS-1994-SwiftW #analysis #evaluation: Analysis of SLG-WAM Evaluation of Definite Programs (TS, DSW), pp. 219–235.
ILPS-1994-SwiftW94a #automaton: An Abstract Machine for SLG Resolution: Definite Programs (TS, DSW), pp. 633–652.
ILPS-1994-Turner #logic programming: Signed Logic Programs (HT), pp. 61–75.
ISSTA-1994-BuyS #analysis #petri net #realtime: Analysis of Real-Time Programs with Simple Time Petri Nets (UAB, RHS), pp. 228–239.
ISSTA-1994-Corbett #ada #analysis #concurrent #empirical #evaluation: An Empirical Evaluation of Three Methods for Deadlock Analysis of Ada Tasking Programs (JCC), pp. 204–215.
ISSTA-1994-Damodaran-KamalF #parallel #testing: Testing Races in Parallel Programs with an OtOt Strategy (SKDK, JMF), pp. 216–227.
LICS-1994-BrogiT #algebra #logic #semantics: Semantics of Meta-Logic in an Algebra of Programs (AB, FT), pp. 262–270.
PODS-1993-Morishita #fixpoint: An Alternating Fixpoint Tailored to Magic Programs (SM), pp. 123–134.
CSM-1993-Abd-El-HafizB #library #using: Documenting Programs Using a Library of Tree Structured Plans (SKAEH, VRB), pp. 152–161.
CSM-1993-CanforaCMT #c #case study #data type: Extracting Abstract Data Types from C Programs: A Case Study (GC, AC, MM, CJT), pp. 200–209.
CSM-1993-LinosADHLT #c #comprehension #named #re-engineering: CARE: An Environment for Understanding and Re-Engineering C Programs (PKL, PA, LD, YH, PL, PT), pp. 130–139.
CSM-1993-RugaberD #cobol #generative: The Transition of Application Programs From COBOL to a Fourth Generation Language (SR, SD), pp. 61–70.
CSM-1993-SneedN #scalability: Downsizing Large Application Programs (HMS, EN), pp. 110–119.
CSM-1993-TurnerR #object-oriented #testing: The State-Based Testing of Object-Oriented Programs (CDT, DJR), pp. 302–310.
WCRE-1993-CutilloFV #component #identification #independence #scalability: Identification and Extraction of “Domain Independent” Components in Large Programs (FC, PF, GV), pp. 83–92.
WCRE-1993-KungGHLT #design #object-oriented #testing: Design Recovery for Software Testing of Object-Oriented Programs (DCK, JG, PH, JL, YT), pp. 202–211.
WCRE-1993-NewcombM #automation #cobol #composition #re-engineering #scalability: Automating the Modularization of Large COBOL Programs: Application of an Enabling Technology for Reengineering (PN, LM), pp. 222–230.
WCRE-1993-RitschS #dynamic analysis #reverse engineering: Reverse Engineering Programs via Dynamic Analysis (HR, HMS), pp. 192–201.
ICALP-1993-Blum #approach #reliability: Program Result Checking: A New Approach to Making Programs More Reliable (MB), pp. 1–14.
ICALP-1993-CodishFMW #analysis #concurrent #constraints #logic programming #performance: Efficient Analysis of Concurrent Constraint Logic Programs (MC, MF, KM, WHW), pp. 633–644.
FME-1993-BrownM #concurrent #proving: A Proof Environment for Concurrent Programs (NB, DM), pp. 196–215.
FME-1993-GuntherSW #database #execution #on the #specification: On the Derivation of Executable Database Programs from Formal Specifications (TG, KDS, IW), pp. 351–366.
FPCA-1993-KozatoO #benchmark #functional #image #lazy evaluation #metric: Benchmarking Real-Life Image Processing Programs in Lazy Functional Languages (YK, GPO), pp. 18–30.
INTERCHI-1993-FixWS: Mental representations of programs by novices and experts (VF, SW, JS), pp. 74–79.
CAiSE-1993-BlazyF #comprehension #fortran #partial evaluation #symbolic computation: Partial Evaluation and Symbolic Computation for the Understanding of Fortran Programs (SB, PF), pp. 184–198.
SEKE-1993-Ameur #development #non-functional: Formal Program Development by Transformation and Non-Functional Properties Evaluations. An Application to Numerical Programs (YAA), pp. 703–710.
SEKE-1993-AzemBJ #prolog #reliability #testing: Implementation-Oriented Testing and Reliability Determination of Prolog Programs (AA, FB, OJ), pp. 526–533.
SEKE-1993-BlazyF #comprehension #fortran #partial evaluation: Partial Evaluation for the Understanding of FORTRAN Programs (SB, PF), pp. 517–525.
SEKE-1993-CanforaCCS #ada #animation #interactive #reverse engineering: Reverse Engineering and Interactive Animation of Ada Programs (GC, AC, UdC, LS), pp. 507–516.
SEKE-1993-Maim #abduction #constraints #logic programming #strict: Restricted Abduction in Constraint Logic Programs (EM), pp. 222–224.
SEKE-1993-MassariCCC #database: Programs as Databases: Treating Code and Comments as First Class Objects (AM, GC, PKC, SKC), pp. 78–85.
SEKE-1993-ShinCY #prolog #type inference: Mode Based Type Inference for Prolog Programs (DS, YC, HY), pp. 239–243.
TOOLS-EUROPE-1993-BergerS #c++ #compilation #database #relational: A Compiler To Create Relational Database Schemes From Application Programs Written in C++ (EB, ES), pp. 75–86.
TOOLS-PACIFIC-1993-Silva-Lepe #migration #object-oriented: A Model for Migrating Procedural Programs into Object-Oriented Programs (ISL), pp. 193–209.
AdaEurope-1993-CherniackDF #ada: Tool for Computing Cohesion and Coupling in Ada Programs: DIANA Dependent Part (JRC, HSD, JFF), pp. 180–196.
AdaEurope-1993-Lundberg #ada #evaluation #parallel #performance #using: Performance Evaluation of Parallel Ada Programs Using an Experimental Multiprocessor (LL), pp. 280–297.
AdaEurope-1993-WallABL #ada #performance: Performance Expectations on Ada Programs (GW, LA, LB, KL), pp. 227–239.
LOPSTR-1993-BergadanoG #induction #logic programming #synthesis: Inductive Synthesis of Logic Programs and Inductive Logic Programming (FB, DG), pp. 45–56.
LOPSTR-1993-Grobelnik #induction #prolog: Induction of Prolog Programs with Markus (MG), pp. 57–63.
LOPSTR-1993-LauO #deduction #logic programming #specification #synthesis: A Formal View of Specification, Deductive Synthesis and Transformation of Logic Programs (KKL, MO), pp. 10–31.
LOPSTR-1993-MaddenHGB #automation #generative #performance #proving #theorem proving #using: A General Technique for Automatically Generating Efficient Programs Through the Use of Proof Planning (PM, JH, IG, AB), pp. 64–66.
LOPSTR-1993-ProiettiP #proving #synthesis: Synthesis of Programs from Unfold/Fold Proofs (MP, AP), pp. 141–158.
LOPSTR-1993-Vargas-VeraRI #editing #prolog: Combining Prolog Programs in a Techniques Editing System (MVV, DSR, RI), pp. 82–84.
PEPM-1993-Gallagher #logic programming #tutorial: Tutorial on Specialisation of Logic Programs (JPG), pp. 88–98.
PEPM-1993-Prestwich #deduction #online #scalability: Online Partial Deduction of Large Programs (SDP), pp. 111–118.
PEPM-1993-Thiemann #analysis #functional #safety: A Safety Analysis for Functional Programs (PT), pp. 133–144.
PLDI-1993-HongG #compilation #realtime: Compiling Real-Time Programs into Schedulable Code (SH, RG), pp. 166–176.
PLILP-1993-AlpuenteFRV #approximate #equation #logic programming #optimisation: Narrowing Approximations as an Optimization for Equational Logic Programs (MA, MF, MJR, GV), pp. 391–409.
PLILP-1993-Boye #functional #logic programming: Avoiding Dynamic Delays in Functional Logic Programs (JB), pp. 12–27.
PLILP-1993-HanusJ #debugging #functional #logic programming: A Debugging Model for Functional Logic Programs (MH, BJ), pp. 28–43.
POPL-1993-ChatterjeeGST #array #automation: Automatic Array Alignment in Data-Parallel Programs (SC, JRG, RS, SHT), pp. 16–28.
POPL-1993-CodishDG #analysis #composition #logic programming: Compositional Analysis of Modular Logic Programs (MC, SKD, RG), pp. 451–464.
POPL-1993-Leivant #complexity #functional: Stratified Functional Programs and Computational Complexity (DL), pp. 325–333.
POPL-1993-MarriottS #constraints #logic programming #optimisation #order #refinement: The 3 R’s of Optimizing Constraint Logic Programs: Refinement, Removal and Reordering (KM, PJS), pp. 334–344.
POPL-1993-SrinivasanHW #parallel: Static Single Assignment for Explicitely Parallel Programs (HS, JH, MW), pp. 260–272.
WSA-1993-BoyePM #functional #logic programming #synthesis: Synthesis of Directionality Information for Functional Logic Programs (JB, JP, JM), pp. 165–177.
WSA-1993-ErringtonHJ #congruence: A Congruence for Gamma Programs (LE, CH, TPJ), pp. 242–253.
WSA-1993-Roy #challenge #logic programming #static analysis: Challenges in Developing Useful and Practical Static Analysis for Logic Programs (PVR), p. 111.
ESEC-1993-Bourdoncle #abstract interpretation #debugging #imperative: Assertion-based Debugging of Imperative Programs by Abstract Interpretation (FB), pp. 501–516.
ESEC-1993-CheungK #analysis #detection #distributed: Tractable Flow Analysis for Anomaly Detection in Distributed Programs (SCC, JK), pp. 283–300.
ICSE-1993-Tai #generative #testing: Predicate-Based Test Generation for Computer Programs (KCT), pp. 267–276.
SAC-1993-ClematisG #fault tolerance: A Hierarchical Structure for Fault Tolerant Reactive Programs (AC, VG), pp. 208–214.
PDP-1993-KindlerNS #imperative #parallel: Hierarchical parallelization of imperative programs (AK, TN, BS), pp. 178–184.
PDP-1993-LevrouwA #memory management #performance: An efficient record-replay mechanism for shared memory programs (LL, KA), pp. 169–176.
PPoPP-1993-ChatterjeeGLST #communication #generative #set: Generating Local Address and Communication Sets for Data-Parallel Programs (SC, JRG, FJEL, RS, SHT), pp. 149–158.
PPoPP-1993-GrunwaldS #data flow #equation #parallel: Data Flow Equations for Explicitly Parallel Programs (DG, HS), pp. 159–168.
PPoPP-1993-PrinsP: Transforming High-Level Data-Parallel Programs into Vector Operations (JP, DWP), pp. 119–128.
PPoPP-1993-SarukkaiM #analysis: Perturbation Analysis of High Level Instrumentation for SPMD Programs (SRS, ADM), pp. 44–53.
TAPSOFT-1993-Vandevoorde #performance #specification: Specifications Can Make Programs Run Faster (MTV), pp. 215–229.
CAV-1993-Gordon #imperative #verification: A Verifier and Timing Analyser for Simple Imperative Programs (MJCG), p. 320.
CAV-1993-Halbwachs #analysis: Delay Analysis in Synchronous Programs (NH), pp. 333–346.
CAV-1993-JourdanMO #realtime #verification: Verifying Quantitative Real-Time Properties of Synchronous Programs (MJ, FM, AO), pp. 347–358.
ICLP-1993-CarroGH #execution #logic programming #paradigm #parallel #visualisation: Some Paradigms for Visualizing Parallel Execution of Logic Programs (MC, LMGH, MVH), pp. 184–200.
ICLP-1993-CodishDFB #analysis #correctness #logic programming #question: Freeness Analysis for Logic Programs — And Correctness? (MC, DD, GF, MB), pp. 116–131.
ICLP-1993-DawsonRRS #logic programming: Extracting Determinacy in Logic Programs (SD, CRR, IVR, RCS), pp. 424–438.
ICLP-1993-InoueS #abduction #logic programming: Transforming Abductive Logic Programs to Disjunctive Programs (KI, CS), pp. 335–353.
ICLP-1993-LauO #deduction #logic programming #synthesis: An Incompleteness Result for Deductive Synthesis of Logic Programs (KKL, MO), pp. 456–477.
ICLP-1993-Luttringhaus-Kappel #generative #logic programming: Control Generation for Logic Programs (SLK), pp. 478–495.
ICLP-1993-McCarty #higher-order #induction #logic #prolog #proving: Proving Inductive Properties of Prolog Programs in Second-Order Intuitionistic Logic (LTM), pp. 44–63.
ICLP-1993-RaoKS #haskell #proving #termination: Proving Termination of GHC Programs (MRKKR, DK, RKS), pp. 720–736.
ICLP-1993-SakamaI #logic programming: Negation in Disjunctive Logic Programs (CS, KI), pp. 703–719.
ICLP-1993-Turner #logic programming #theorem: A Monotonicity Theorem for Extended Logic Programs (HT), pp. 567–585.
ILPS-1993-AguzziM #logic programming #term rewriting #termination: Termination of Logic Programs via Equivalent Rewrite Systems (GA, UM), p. 634.
ILPS-1993-BandaH #analysis #approach: A Practical Approach to the Global Analysis of CLP Programs (MJGdlB, MVH), pp. 437–455.
ILPS-1993-BandaHM #constraints #independence #logic programming: Independence in Constraint Logic Programs (MJGdlB, MVH, KM), pp. 130–146.
ILPS-1993-BaralGK #approximate #logic programming: Approximating General Logic Programs (CB, MG, OK), pp. 181–198.
ILPS-1993-Bsaies #automation #logic programming #performance: Automated Derivation of Efficient Logic Programs by Synthesizing Eureka Properties (KB), p. 633.
ILPS-1993-CodishD #logic programming #using: Analysing Logic Programs Using “Prop”-ositional Logic Programs and a Magic Wand (MC, BD), pp. 114–129.
ILPS-1993-Debray #logic programming #static analysis: Static Analysis of Logic Programs (SKD), pp. 43–44.
ILPS-1993-Fitting #logic programming #metric #semantics: Metric Methods in the Semantics of Logic Programs (MF), pp. 69–71.
ILPS-1993-HanL #evaluation #recursion: Evaluation of Regular Nonlinear Recursive Programs (JH, LVSL), p. 648.
ILPS-1993-KirschenbaumS #prolog #proving: Enhancement Structures for Proving Prolog Programs Correct (MK, LS), p. 631.
ILPS-1993-Nilsson #bottom-up #evaluation #logic programming: Goal-directed Bottom-up Evaluation of Normal Logic Programs (UN), p. 647.
ILPS-1993-Sohn #analysis #logic programming #relational: Relational Groundness Analysis for Logic Programs (KS), p. 635.
ILPS-1993-Tarau #continuation #performance: An Efficient Specialization of the WAM for Continuation Passing Binary Programs (PT), p. 652.
ILPS-1993-Teusink #logic programming #proving: A Proof Procedure for Extended Logic Programs (FT), pp. 235–249.
ILPS-1993-Vargas-VeraVR #editing #prolog #scalability #using: Building Large-Scale Prolog Programs using a Techniques Editing System (MVV, WWV, DSR), p. 636.
ILPS-1993-YouY #logic programming: Contradiction Resolving for Extended Logic Programs and Default Theories (JHY, LYY), p. 640.
ISSTA-1993-BelliJ #analysis #prolog #testing: Implementation-Based Analysis and Testing of Prolog Programs (FB, OJ), pp. 70–80.
ISSTA-1993-Blum #design: Designing Programs to Check Their Work (MB), p. 1.
PODS-1992-BeeriRSS #logic programming #semantics: The Valid Model Semantics for Logic Programs (CB, RR, DS, SS), pp. 91–104.
PODS-1992-ChaudhuriV #datalog #equivalence #on the #recursion: On the Equivalence of Recursive and Nonrecursive Datalog Programs (SC, MYV), pp. 55–66.
PODS-1992-Morishita #multi: Avoiding Cartesian Products in Programs for Multiple Joins (SM), pp. 368–379.
ICALP-1992-Debray #analysis #complexity #data flow #logic programming #on the: On the Complexity of Dataflow Analysis of Logic Programs (SKD), pp. 509–520.
ICALP-1992-SannellaT #algebra #development #specification #towards: Towards Formal Development of Programs from Algebraic Specifications: Model-Theoretic Foundations (DS, AT), pp. 656–671.
LFP-1992-SabryF #continuation #reasoning: Reasoning About Programs in Continuation-Passing Style (AS, MF), pp. 288–298.
LFP-1992-TraubCS #analysis #clustering #strict #thread: Global Analysis for Partitioning Non-Strict Programs into Sequential Threads (KRT, DEC, KES), pp. 324–334.
KR-1992-Dix #framework #logic programming #representation #semantics: A Framework for Representing and Characterizing Semantics of Logic Programs (JD), pp. 591–602.
ML-1992-HoggerB #approach #heuristic #learning #logic programming: The MENTLE Approach to Learning Heuristics for the Control of Logic Programs (EIH, KB), pp. 212–217.
ML-1992-LapointeM #induction #named #performance #recursion: Sub-unification: A Tool for Efficient Induction of Recursive Programs (SL, SM), pp. 273–281.
SEKE-1992-HuangSM #modelling #reverse engineering #rule-based #visual notation: A Rule-Based Tool for Reverse Engineering from Source Code to Graphical Models (HH, KS, IM), pp. 178–185.
SEKE-1992-KraiemB #concept #object-oriented #specification: Mapping of Conceptual Specifications into Object-Oriented Programs (NK, JB), pp. 624–639.
SEKE-1992-MillerQ #approach #knowledge-based #modelling #reuse #simulation #using: A Knowledge-Based Approach to Encouraging Reuse of Simulation and Modeling Programs (LM, AQ), pp. 158–163.
SEKE-1992-ShimuraLM #logic programming #petri net #semantics: A Petri Net Semantics for Logic Programs with Negation (TS, JL, TM), pp. 292–299.
TOOLS-USA-1992-RajaramanL #c++ #metric: Some Coupling Measures for C++ Programs (CR, MRL), pp. 225–234.
AdaEurope-1992-Cheng #ada #concurrent #dependence #representation: Task Dependence Net as a Representation for Concurrent Ada Programs (JC), pp. 150–164.
AdaEurope-1992-DuellSW #ada #code generation #scalability #using: Using Ada Source Code Generators in a Large Project (RD, HJS, FCAdW), pp. 47–59.
AdaEurope-1992-Lundberg #ada #parallel #predict: Predicting the Speedup of Parallel Ada Programs (LL), pp. 257–274.
AdaEurope-1992-ThomasDB #ada #evaluation #reuse: An Evaluation of Ada Source Code Reuse (WMT, AD, VRB), pp. 80–91.
ALP-1992-AravindanD #deduction #logic programming #semantics: Partial Deduction of Logic Programs wrt Well-Founded Semantics (CA, PMD), pp. 384–402.
ALP-1992-KingS #analysis #concurrent #logic programming: Serialisation Analysis of Concurrent Logic Programs (AK, PS), pp. 322–334.
LOPSTR-1992-BoulangerB #abstract interpretation #logic programming #using: Deriving Transformations for Logic Programs Using Abstract Interpretation (DB, MB), pp. 99–117.
LOPSTR-1992-FribourgO #induction #logic programming: A Unifying View of Structural Induction and Computation Induction for Logic Programs (LF, HO), pp. 46–60.
LOPSTR-1992-GallagherW #logic programming: Deletion of Redundant Unary Type Predicates from Logic Programs (JPG, DAdW), pp. 151–167.
LOPSTR-1992-Loria-Saenz #synthesis: Synthesis of Narrowing Programs (CLS), pp. 30–45.
LOPSTR-1992-NardiR #deduction #query #synthesis: Deductive Synthesis of Programs for Query Answering (DN, RR), pp. 15–29.
LOPSTR-1992-ParrainDL #abstract interpretation #optimisation #prolog #towards: Towards Optimization of Full Prolog Programs Guided by Abstract Interpretation (AP, PD, PL), pp. 228–241.
LOPSTR-1992-ProiettiP #incremental #logic programming: Best-first Strategies for Incremental Transformations of Logic Programs (MP, AP), pp. 82–98.
PEPM-1992-Field #imperative #program analysis #semantics: A Simple Rewriting Semantics for Realistic Imperative Programs and its Application to Program Analysis (JF), pp. 98–107.
PEPM-1992-Malmkjaer #predict: Predicting Properties of Residual Programs (KM), pp. 8–13.
PEPM-1992-ShermanS #equation #logic programming: Call Unfolding Strategies for Equational Logic Programs (DS, RS), pp. 48–53.
PLDI-1992-DhamdhereRZ #how #scalability: How to Analyze Large Programs Efficiently and Informatively (DMD, BKR, FKZ), pp. 212–223.
PLDI-1992-HendrenHN #abstraction #analysis #data type #imperative #pointer #recursion: Abstractions for Recursive Pointer Data Structures: Improving the Analysis of Imperative Programs (LJH, JH, AN), pp. 249–260.
PLDI-1992-Lucco #parallel #scheduling: A Dynamic Scheduling Technique for Irregular Parallel Programs (SL), pp. 200–211.
PLDI-1992-TanL #analysis #compilation #data flow #logic programming: Compiling Dataflow Analysis of Logic Programs (JT, IPL), pp. 106–115.
PLILP-1992-Alexandre #logic programming: A technique for Transforming Logic Programs by Fold-Unfold Transformations (FA), pp. 202–216.
PLILP-1992-Hanus #functional #logic programming #using: Improving Control of Logic Programs by Using Functional Logic Languages (MH), pp. 1–23.
PLILP-1992-HenrardC #declarative #logic programming #named: FOLON: An Environment for Declarative Construction of Logic Programs (JH, BLC), pp. 217–231.
PLILP-1992-Muck #automaton #functional #logic programming #named: CAMEL: An Extension of the Categorial Abstract Machine to Compile Functional/Logic Programs (AM), pp. 341–354.
PLILP-1992-SolnonR #inheritance #prolog: Inference of Inheritance Relationships from Prolog Programs: a System Developed with PrologIII (CS, MR), pp. 489–490.
PLILP-1992-Thiemann #bottom-up #evaluation #functional #named #tool support: LaToKi: A Language Toolkit for Bottom-Up Evaluation of Functional Programs (PT), pp. 481–482.
POPL-1992-BallL #profiling: Optimally Profiling and Tracing Programs (TB, JRL), pp. 59–70.
POPL-1992-ChowH #analysis #memory management #parallel: Compile-Time Analysis of Parallel Programs that Share Memory (JHC, WLHI), pp. 130–141.
TRI-Ada-C-1992-Acosta #ada #concurrent #prototype #specification: Specification Prototyping of Concurrent Ada Programs in DProto (RDA), pp. 258–266.
TRI-Ada-C-1992-BurgerBVTSB #ada #distributed: A Practical Tool for Distributing Ada Programs: TeleSoft’s Distributed Ada Configuration Tool (TB, JBB, RAV, RT, GS, KHB), pp. 484–492.
WSA-1992-BagnaraGL #static analysis: Static Analysis of CLP Programs over Numeric Domains (RB, RG, GL), pp. 43–50.
WSA-1992-CodishFMW #analysis #concurrent #constraints #logic programming #performance: Efficient Analysis of Reactive Properties of Concurrent Constraint Logic Programs (MC, MF, KM, WHW), pp. 35–42.
WSA-1992-Hamilton #analysis #first-order #functional #lazy evaluation: Sharing Analysis of Lazy First-Order Functional Programs (GWH), pp. 68–78.
WSA-1992-HankinMS: Transformation of Gamma Programs (CH, DLM, DS), pp. 12–19.
WSA-1992-Hanus #abstract interpretation #algorithm #logic programming: An Abstract Interpretation Algorithm for Residuating Logic Programs (MH), pp. 304–312.
WSA-1992-MesnardM #automation #generative #linear #metric: Automatic Generation of Valid Linear Measures for CLP(Q) Programs (FM, MM), pp. 29–34.
WSA-1992-ParrainDL #abstract interpretation #optimisation #prolog #towards: Towards Optimization of Full Prolog Programs guided by Abstract Interpretation (AP, PD, PL), pp. 295–303.
ICSE-1992-AfifiWZ #fault #linear #testing: Testing for Linear Errors in Nonlinear Computer Programs (FHA, LJW, SJZ), pp. 81–91.
ICSE-1992-FernandezGMRRS #verification: A Toolbox for the Verification of LOTOS Programs (JCF, HG, LM, AR, CR, JS), pp. 246–259.
ICSE-1992-RomanC #visualisation: Program Visualization: The Art of Mapping Programs to Pictures (GCR, KCC), pp. 412–420.
SOSP-WIP-1991-Weihl92 #named #parallel #tool support: Prelude: Tools for Building Portable Parallel Programs (WEW), p. 24.
CC-1992-VitekHU #analysis #object-oriented: Compile-Time Analysis of Object-Oriented Programs (JV, RNH, JSU), pp. 236–250.
IWMM-1992-DuvvuruSTSHZ #concurrent #logic programming: A Compile-Time Memory-Reuse Scheme for Concurrent Logic Programs (SD, RS, ET, AVSS, LH, XZ), pp. 264–276.
ESOP-1992-HogenKL #automation #functional #lazy evaluation #parallel: Automatic Parallelization of Lazy Functional Programs (GH, AK, RL), pp. 254–268.
CADE-1992-BoyerY #automation #correctness #proving: Automated Correctness Proofs of Machine Code Programs for a Commercial Microprocessor (RSB, YY), pp. 416–430.
CADE-1992-HeskethBS #reasoning #recursion #synthesis #using: Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive Programs (JH, AB, AS), pp. 310–324.
CSL-1992-Stark #logic programming: Negation-Complete Logic Programs (RFS), pp. 403–409.
JICSLP-1992-Ben-EliyahuD #logic programming: Propositional Sematics for Disjunctive Logic Programs (RBE, RD), pp. 813–827.
JICSLP-1992-Bonatti #framework #logic #logic programming #semantics: Autoepistemic Logics as a Unifying Framework for the Semantics of Logic Programs (PAB), pp. 417–430.
JICSLP-1992-BrogiLMM #logic programming: Normal Logic Programs as Open Positive Programs (AB, EL, PM, PM), pp. 783–797.
JICSLP-1992-BronsardLR #framework #logic programming #proving #termination: A Framework of Directionality for Proving Termination of Logic Programs (FB, TKL, USR), pp. 321–335.
JICSLP-1992-ChandyK #composition: The Derivation of Compositional Programs (KMC, CK), pp. 3–17.
JICSLP-1992-DeneckerS #abduction #named: SLDNFA: An Abductive Procedure for Normal Abductive Programs (MD, DDS), pp. 686–700.
JICSLP-1992-Dix #logic programming #semantics: Classifying Semantics of Disjunctive Logic Programs (JD), pp. 798–812.
JICSLP-1992-FerrandD #correctness #logic programming #proving: Proof Method of Partial Correctness and Weak Completeness for Normal Logic Programs (GF, PD), pp. 161–174.
JICSLP-1992-GabbrielliLM #logic programming: Observational Equivalences for Logic Programs (MG, GL, MCM), pp. 131–145.
JICSLP-1992-GrogerP #automation #logic programming #proving #recursion #termination: Handling of Mutual Recursion in Automatic Termination Proofs for Logic Programs (GG, LP), pp. 336–350.
JICSLP-1992-Harland #equivalence #logic programming #normalisation #on the: On Normal Forms and Equivalence for Logic Programs (JH), pp. 146–160.
JICSLP-1992-KempSS #bottom-up #evaluation #logic programming #query #strict: Query Restricted Bottom-Up Evaluation of Normal Logic Programs (DBK, PJS, DS), pp. 288–302.
JICSLP-1992-KingS #analysis #concurrent #logic programming: Schedule Analysis of Concurrent Logic programs (AK, PS), pp. 478–492.
JICSLP-1992-SundararajanST #analysis #concurrent #logic programming #thread: Variable Threadedness Analysis for Concurrent Logic Programs (RS, AVSS, ET), pp. 493–508.
JICSLP-1992-Wiggins #development #logic programming #proving #synthesis: Synthesis and Transformation of Logic Programs in the Whelk Proof Development System (GAW), pp. 351–365.
PODS-1991-BrodskyS #constraints #difference #logic programming: Inference of Inequality Constraints in Logic Programs (AB, YS), pp. 227–240.
PODS-1991-Ross #composition #logic programming #recursion: Modular Acyclicity and Tail Recursion in Logic Programs (KAR), pp. 92–101.
PODS-1991-SeibL #datalog: Parallelizing Datalog Programs by Generalized Pivoting (JS, GL), pp. 241–251.
PODS-1991-SohnG #detection #logic programming #termination #using: Termination Detection in Logic Programs using Argument Sizes (KS, AVG), pp. 216–226.
SIGMOD-1991-SudarshanSRN #bottom-up #evaluation #logic programming #optimisation: Space Optimization in the Bottom-Up Evaluation of Logic Programs (SS, DS, RR, JFN), pp. 68–77.
ICALP-1991-Fernando #recursion: Provably Recursive Programs and Program Extraction (TF), pp. 303–313.
ICALP-1991-GabbrielliL #logic programming #on the #semantics: On the Semantics of Logic Programs (MG, GL), pp. 1–19.
FPCA-1991-Traub #architecture #code generation #data flow #multi #strict #thread: Multi-thread Code Generation for Dataflow Architectures from Non-Strict Programs (KRT), pp. 73–101.
KR-1991-GabbayLV #logic programming #order #semantics: Credulous vs. Sceptical Semantics for Ordered Logic Programs (DMG, EL, DV), pp. 208–217.
KR-1991-GeneserethH: Partial Programs (MRG, JYjH), pp. 238–249.
ML-1991-KijsirikulNS #learning #logic programming #performance: Efficient Learning of Logic Programs with Non-determinant, Non-discriminating Literals (BK, MN, MS), pp. 417–421.
TOOLS-USA-1991-JamrozikRS #debugging #distributed #visual notation: A Graphical Debugger for O-O Distributed Programs (HJ, CR, MS), pp. 117–128.
LOPSTR-1991-AlexandreBQ #logic programming #on the #using: On Using Mode Input-output for Transforming Logic Programs (FA, KB, AQ), pp. 129–146.
LOPSTR-1991-Eusterbrock #abstraction #learning #logic programming: Speed-up Transformations of Logic Programs by Abstraction and Learning (JE), pp. 167–182.
LOPSTR-1991-FuchsF #logic programming: Schema-Based Transfomations of Logic Programs (NEF, MPJF), pp. 111–125.
LOPSTR-1991-LecoutreDL #abstract interpretation #behaviour #logic programming #recursion: Abstract Interpretation and Recursive Behaviour of Logic Programs (CL, PD, PL), pp. 147–166.
LOPSTR-1991-Popelinsky #prolog #synthesis #towards: Towards Synthesis of Nearly Pure Prolog Programs (LP), pp. 94–96.
LOPSTR-1991-ProiettiP #automation #logic programming: An Automatic Transfomation Strategy for Avoiding Unnecessary Variables in Logic Programs (MP, AP), pp. 126–128.
LOPSTR-1991-Ross #partial evaluation #prolog #semantics: Semantics-based Partial Evaluation of Prolog Programs (BJR), pp. 221–237.
LOPSTR-1991-WigginsBKH #induction #logic programming #proving #synthesis: Synthesis and Transfomation of Logic Programs from Constructive, Inductive Proof (GAW, AB, IK, JH), pp. 27–45.
PEPM-1991-CortesiF #abstract domain #abstract interpretation #analysis #logic programming: Abstract Interpretation of Logic Programs: An Abstract Domain for Groundness, Sharing, Freeness and Compoundness Analysis (AC, GF), pp. 52–61.
PEPM-1991-ShermanSD #equation #optimisation #partial evaluation #using: Optimization of Equational Programs Using Partial Evaluation (DS, RS, ID), pp. 72–82.
PEPM-1991-Sundaresh #incremental #partial evaluation #using: Building Incremental Programs using Partial Evaluation (RSS), pp. 83–93.
PLDI-1991-ChatterjeeBF: Size and Access Inference for Data-Parallel Programs (SC, GEB, ALF), pp. 130–144.
PLILP-1991-Boye #logic programming #named #semantics: S-SLD-resolution — An Operational Semantics for Logic Programs with External Procedures (JB), pp. 383–393.
PLILP-1991-HalbwachsRR #data flow #generative #performance: Generating Efficient Code From Data-Flow Programs (NH, PR, CR), pp. 207–218.
PLILP-1991-KosterB #on the: On the Borderline Between Grammars and Programs (CHAK, JB), pp. 219–230.
PLILP-1991-ProiettiP #logic programming #named #order: Unfolding — Definition — Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs (MP, AP), pp. 347–358.
WSA-1991-Chin #deforestation #first-order #functional: Generalising Deforestation for All First-Order Functional Programs (WNC), pp. 173–181.
WSA-1991-CousotC #abstract interpretation #functional #higher-order #relational: Relational Abstract Interpretation of Higher Order Functional Programs (PC, RC), pp. 33–36.
WSA-1991-DenisD #fixpoint #logic programming #semantics: Unfolding, Procedural and Fixpoint Semantics of Logic Programs (FD, JPD), pp. 157–164.
WSA-1991-DurandSS #equation #partial evaluation: Partial Evaluation of an Intermediate Language for Equational Programs (ID, DS, RS), pp. 98–106.
WSA-1991-HamiltonJ: Transforming Programs to Eliminate Intermediate Structures (GWH, SBJ), pp. 182–188.
WSA-1991-Malmkjaer #on the: On Static Properties of Specialized Programs (KM), pp. 234–241.
ESEC-1991-Berzins #modelling: Software Merge: Models and Methods for Combining Changes to Programs (VB), pp. 229–250.
ESEC-1991-RozmanGD #analysis #metric: Relation Between Source Code Metrics and Structure Analysis Metrics (IR, JG, TD), pp. 332–342.
ICSE-1991-Hartman #composition #comprehension #using: Understanding Natural Programs Using Proper Decomposition (JH), pp. 62–73.
ASPLOS-1991-AppelL #memory management: Virtual Memory Primitives for User Programs (AWA, KL), pp. 96–107.
ASPLOS-1991-BagrodiaM #implementation #parallel #performance: Efficient Implementation of High Level Parallel Programs (RB, SM), pp. 142–151.
PPoPP-1991-BakewellQW #concurrent: Mapping Concurrent Programs to VLIW Processors (HB, DJQ, PYW), pp. 21–27.
CCPSD-1991-BossiCF #logic programming #proving #termination: Proving Termination of Logic Programs by Exploiting Term Properties (AB, NC, MF), pp. 153–180.
CSL-1991-RaoKS #logic programming #proving #termination: A Transformational Methodology for Proving Termination of Logic Programs (MRKKR, DK, RKS), pp. 213–226.
CSL-1991-Schmerl #proving: A Cut-Elimination Procedure Designed for Evaluating Proofs as Programs (URS), pp. 316–325.
ICLP-1991-BachmairG #logic programming #semantics #similarity: Perfect Model Semantics for Logic Programs with Equality (LB, HG), pp. 645–659.
ICLP-1991-CodishFM #analysis #concurrent #logic programming: Suspension Analysis for Concurrent Logic Programs (MC, MF, KM), pp. 331–345.
ICLP-1991-ColussiM #axiom #correctness #logic programming #proving #semantics #using: Proving Correctness of Logic Programs Using Axiomatic Semantics (LC, EM), pp. 629–642.
ICLP-1991-Cousot #abstract interpretation #logic programming: Abstract Interpretation of Logic Programs (PC), p. 940.
ICLP-1991-DebrayL #analysis #automation #complexity #logic programming: Automatic Complexity Analysis of Logic Programs (SKD, NWL), pp. 599–613.
ICLP-1991-GabbrielliL #constraints #logic programming #modelling: Modeling Answer Constraints in Constraint Logic Programs (MG, GL), pp. 238–252.
ICLP-1991-Harland #logic programming: A Clausal Form for the Completion of Logic Programs (JH), pp. 711–725.
ICLP-1991-HuY #logic programming #semantics: Extended Well-Founded Model Semantics for General Logic Programs (YH, LYY), pp. 412–425.
ICLP-1991-Inoue #logic programming: Extended Logic Programs with Default Assumptions (KI), pp. 490–504.
ICLP-1991-Kowalski #logic programming: Legislation as Logic Programs (RAK), p. 910.
ICLP-1991-Levi #logic programming #on the #semantics: On the Semantics of Logic Programs (GL), p. 945.
ICLP-1991-MoscowitzS #logic programming: Lexical Logic Programs (YM, EYS), pp. 349–363.
ICLP-1991-Przymusinski #logic programming: Well-Founded Completions of Logic Programs (TCP), pp. 726–741.
ICLP-1991-Turi #logic programming: Extending S-Models to Logic Programs with Negation (DT), pp. 397–411.
ICLP-1991-VerschaetseS #logic programming #proving #termination #using: Deriving Termination Proofs for Logic Programs, Using Abstract Procedures (KV, DDS), pp. 301–315.
ICLP-1991-YardeniFS #logic programming: Polymorphically Typed Logic Programs (EY, TWF, EYS), pp. 379–393.
ISLP-1991-BruynoogheSM #deduction #infinity #logic programming: A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs (MB, DDS, BM), pp. 117–131.
ISLP-1991-DeransartFT: NSTO Programs (Not Subject to Occur-Check) (PD, GF, MT), pp. 533–547.
ISLP-1991-FosterKT #composition #parallel #programming #using: Using Compositional Programming to Write Portable, High-Performance Parallel Programs (ITF, CK, ST), pp. 737–738.
ISLP-1991-KakasM #logic programming: Stable Theories for Logic Programs (ACK, PM), pp. 85–100.
ISLP-1991-Kawamura #logic programming #performance: Derivation of Efficient Logic Programs by Synthesizing New Predicates (TK), pp. 611–625.
ISLP-1991-KempS #logic programming #semantics: Semantics of Logic Programs with Aggregates (DBK, PJS), pp. 387–401.
ISLP-1991-Millroth #compilation #logic programming: Reforming Compilation of Logic Programs (HM), pp. 485–499.
ISLP-1991-Plumer #automation #prolog #proving #termination: Automatic Termination Proofs for Prolog Programs Operating on Nonground Terms (LP), pp. 503–517.
ISLP-1991-ReedLS #logic programming: An Alternative Characterization of Disjunctive Logic Programs (DWR, DWL, BTS), pp. 54–68.
ISLP-1991-Sagiv #logic programming #termination: A Termination Test for Logic Programs (YS), pp. 518–532.
ISLP-1991-SatoM #first-order #interpreter #top-down: A Complete Top-Down Interpreter for First Order Programs (TS, FM), pp. 35–53.
IWPTS-1991-ArakawaS #concurrent #generative #testing: A Test Case Generation Method for Concurrent Programs (NA, TS), pp. 95–106.
LICS-1991-FruhwirthSVY #logic programming: Logic Programs as Types for Logic Programs (TWF, EYS, MYV, EY), pp. 300–309.
TAV-1991-DoongF #case study #object-oriented #testing: Case Studies on Testing Object-Oriented Programs (RKD, PGF), pp. 165–177.
TAV-1991-PandeL #c #interprocedural: Interprocedural Def-Use Associations in C Programs (HDP, WL), pp. 139–153.
PODS-1990-Gelder #constraints #logic programming: Deriving Constraints Among Argument Sizes in Logic Programs (AVG), pp. 47–60.
PODS-1990-Ross #composition #datalog #set: Modular Stratification and Magic Sets for DATALOG Programs with Negation (KAR), pp. 161–171.
PODS-1990-SaccaZ #logic programming #modelling #nondeterminism: Stable Models and Non-Determinism in Logic Programs with Negation (DS, CZ), pp. 205–217.
SIGMOD-1990-Saraiya #logic programming #problem: Hard Problems for Simple Logic Programs (YPS), pp. 64–73.
VLDB-1990-RamakrishnanSS #bottom-up #evaluation #fixpoint #logic programming: Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs (RR, DS, SS), pp. 359–371.
VLDB-1990-Wood: Factoring Augmented Regular Chain Programs (PTW), pp. 255–263.
SEI-1990-FordBBFGO #re-engineering: Graduate Programs in Software Engineering (GAF, ATB, DRB, BMF, NEG, DO), pp. 145–156.
LFP-1990-Gomard #functional #type inference: Partial Type Inference for Untyped Functional Programs (CKG), pp. 282–287.
LFP-1990-MohrKH #lazy evaluation #parallel: Lazy Task Creation: A Technique for Increasing the Granularity of Parallel Programs (EM, DAK, RHHJ), pp. 185–197.
SEKE-1990-Iyengar #execution #logic programming: Intelligent Forward Execution in Logic Programs (SRI), pp. 153–158.
OOPSLA-ECOOP-1990-LeavensW #object-oriented #reasoning #type system: Reasoning about Object-Oriented Programs that Use Subtypes (GTL, WEW), pp. 212–223.
ALP-1990-Dung #logic programming #on the: On the strong completion of logic programs (PMD), pp. 158–172.
ALP-1990-GabbrielliL #concurrent #constraints #fixpoint #logic programming #semantics: Unfolding and Fixpoint Semantics of Concurrent Constraint Logic Programs (MG, GL), pp. 204–216.
ALP-1990-Hanus #equation #logic programming #specification: Logic Programs with Equational Type Specifications (MH), pp. 70–85.
ALP-1990-KanchanasutS #logic programming: Eliminating Negation from Normal Logic Programs (KK, PJS), pp. 217–231.
PLDI-1990-ChambersU #analysis #dynamic typing #object-oriented #optimisation: Iterative Type Analysis and Extended Message Splitting: Optimizing Dynamically-Typed Object-Oriented Programs (CC, DU), pp. 150–164.
PLDI-1990-DebrayLH #analysis #logic programming: Task Granularity Analysis in Logic Programs (SKD, NWL, MVH), pp. 174–188.
PLDI-1990-LeeB #optimisation: Optimizing Programs over the Constructive Reals (VALJ, HJB), pp. 102–111.
PLDI-1990-Tseng #array #compilation #linear: Compiling Programs for a Linear Systolic Array (PST), pp. 311–321.
PLILP-1990-Hanus #compilation #logic programming #similarity: Compiling Logic Programs with Equality (MH), pp. 387–400.
PLILP-1990-MasonT #reasoning: Reasoning About Programs with Effects (IAM, CLT), pp. 189–203.
PLILP-1990-Nilsson #approximate #logic programming #semantics: Systematic Semantic Approximations of Logic Programs (UN), pp. 293–306.
PLILP-1990-TarauB #logic programming: Elementary Logic Programs (PT, MB), pp. 159–173.
PLILP-1990-WangS #logic programming #termination #towards: Towards a Characterization of Termination of Logic Programs (BW, RKS), pp. 204–221.
POPL-1990-Gunter #correctness #nondeterminism: Relating Total and Partial Correctness Interpretations of Non-Deterministic Programs (CAG), pp. 306–319.
POPL-1990-HeintzeJ #approximate #finite #logic programming #theorem: A Finite Presentation Theorem for Approximating Logic Programs (NH, JJ), pp. 197–209.
POPL-1990-Ramakrishnan #logic programming #parallel: Parallelism in Logic Programs (RR), pp. 246–260.
ICSE-1990-Maiocchi #named #question #re-engineering: Reengineering: Can a Program Put Intelligence in Stupid Programs? (MM), pp. 123–124.
PPoPP-1990-FuruichiTI #multi: A Multi-Level Load Balancing Scheme for OR-Parallel Exhaustive Search Programs on the Multi-PSI (MF, KT, NI), pp. 50–59.
PPoPP-1990-LiNP #concurrent #parallel #realtime: Real-Time, Concurrent Checkpoint for Parallel Programs (KL, JFN, JSP), pp. 79–88.
ESOP-1990-ProiettiP #logic programming #synthesis: Synthesis of Eureka Predicates for Developing Logic Programs (MP, AP), pp. 306–325.
STOC-1990-Cleve #bound #simulation #towards: Towards Optimal Simulations of Formulas by Bounded-Width Programs (RC), pp. 271–277.
CADE-1990-BaralLM #logic programming #semantics: Generalized Well-founded Semantics for Logic Programs (CB, JL, JM), pp. 102–116.
CADE-1990-WakayamaP #abstraction: Case-Free Programs: An Abstraction of Definite Horn Programs (TW, THP), pp. 87–101.
CLP-1990-AptB90: Acyclic Programs (KRA, MB), pp. 617–633.
CLP-1990-Fages90 #fixpoint #logic programming #semantics: A New Fixpoint Semantics for General Logic Programs Compared with the Well-Founded and the Stable Model Semantics (FF), pp. 441–458.
CLP-1990-Fribourg90 #execution #induction #logic programming #prolog #proving: Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction (LF), pp. 685–699.
CLP-1990-Gaifman90 #logic programming #semantics: Semantics of Logic Programs (HG), pp. 779–782.
CLP-1990-GelfondL90 #logic programming: Logic Programs with Classical Negation (MG, VL), pp. 579–597.
CLP-1990-GiacobazziR90 #logic programming #optimisation #pipes and filters: Pipeline Optimizations in AND-Parallel Logic Programs (RG, LR), pp. 291–305.
CLP-1990-Harel90 #how #question: How Hard Is It to Reason about Propositional Programs? (DH), pp. 772–773.
CLP-1990-JacobsLW90 #logic programming #multi #runtime: Multiple Specialization of Logic Programs with Run-Time Test (DJ, AL, WHW), pp. 717–731.
CLP-1990-KowalskiS90 #exception #logic programming: Logic Programs with Exceptions (RAK, FS), pp. 598–613.
CLP-1990-MeyerC90 #architecture #logic programming: Architected Failure Handling for AND-Parallel Logic Programs (DMM, JSC), pp. 271–290.
CLP-1990-MuthukumarH90 #automation #definite clause grammar #independence #logic programming #parallel: The DCG, UDG, and MEL Methods for Automatic Compile-time Parallelization of Logic Programs for Independent And-parallelism (KM, MVH), pp. 221–236.
CLP-1990-Plumer90 #logic programming #proving #termination: Termination Proofs for Logic Programs Based on Predicate Inequalities (LP), pp. 634–648.
CLP-1990-PowerS90 #logic programming: A Notion of Map between Logic Programs (AJP, LS), pp. 390–404.
CLP-1990-Przymusinski90 #semantics: Extended Stable Semantics for Normal and Disjunctive Programs (TCP), pp. 459–477.
CLP-1990-ShmueliT90a #logic: Logical Diagnosis of LDL Programs (OS, ST), pp. 112–129.
CLP-1990-Vardi90 #database #logic programming #optimisation #problem: Global Optimization Problems for Database Logic Programs (MYV), pp. 767–771.
CSL-1990-Burgard #logic programming #performance: Efficiency Considerations on Goal-Directed Chaining for Logic Programs (WB), pp. 80–94.
LICS-1990-Cerrito #linear #logic programming #semantics: A Linear Semantics for Allowed Logic Programs (SC), pp. 219–227.
LICS-1990-HarelRV #bound #concurrent #on the #power of #reasoning: On the Power of Bounded Concurrency~III: Reasoning About Programs (DH, RR, MYV), pp. 478–488.
LICS-1990-WandW #verification: Conditional λ-Theories and the Verification of Static Properties of Programs (MW, ZYW), pp. 321–332.
NACLP-1990-BenkerimiL #logic programming #partial evaluation: A Partial Evaluation Procedure for Logic Programs (KB, JWL), pp. 343–358.
NACLP-1990-BonacinaH #semantics: Operational and Denotational Semantics of Rewrite Programs (MPB, JH), pp. 449–464.
NACLP-1990-CorradiniM #algebra #logic programming #semantics: An Algebraic Semantics of Logic Programs as Structured Transition Systems (AC, UM), pp. 788–812.
NACLP-1990-GrecoS #logic programming: Negative Logic Programs (SG, DS), pp. 480–497.
NACLP-1990-GuptaJ90a #execution #logic programming #modelling #on the: On Criteria for Or-Parallel Execution Models of Logic Programs (GG, BJ), pp. 737–756.
NACLP-1990-KempR #abstract interpretation #algebra #framework: An Algebraic Framework for Abstract Interpretation of Definite Programs (RSK, GAR), pp. 516–530.
NACLP-1990-Liu #null: Null Values in Definite Programs (YL), pp. 273–288.
NACLP-1990-Lobo #logic programming #on the: On Constructive Negation for Disjunctive Logic Programs (JL), pp. 704–718.
NACLP-1990-MancarellaPRT #algebra #logic programming: Algebraic Properties of a Class of Logic Programs (PM, DP, MR, MT), pp. 23–39.
NACLP-1990-MarriottS #analysis #constraints #logic programming: Analysis of Constraint Logic Programs (KM, HS), pp. 531–547.
NACLP-1990-MarriottSD #logic programming: A Characterization of Non-Floundering Logic Programs (KM, HS, PWD), pp. 661–680.
NACLP-1990-Przymusinski #database #deduction #logic programming #semantics: Stationary Semantics for Disjunctive Logic Programs and Deductive Databases (TCP), pp. 40–59.
NACLP-1990-Reddy #logic programming: Types for Logic Programs (USR), pp. 836–840.
PODS-1989-BrodskyS #constraints #datalog: Inference of Monotonicity Constraints in Datalog Programs (AB, YS), pp. 190–199.
PODS-1989-Gelder #fixpoint #logic programming: The Alternating Fixpoint of Logic Programs with Negation (AVG), pp. 1–10.
PODS-1989-Ross #logic programming #semantics: A Procedural Semantics for Well Founded Negation in Logic Programs (KAR), pp. 22–33.
ICALP-1989-MehlhornP: Two Versus One Index Register and Modifiable Versus Non-modifiable Programs (KM, WJP), pp. 603–609.
ICALP-1989-TuckerZ: Horn Programs and Semicomputable Relations on Abstract Structures (JVT, JIZ), pp. 745–760.
RTA-1989-Strandh #equation #performance: Classes of Equational Programs that Compile into Efficient Machine Code (RS), pp. 449–461.
FPCA-1989-BjernerH #analysis #approach #composition #first-order #functional #lazy evaluation: A Composition Approach to Time Analysis of First Order Lazy Functional Programs (BB, SH), pp. 157–165.
FPCA-1989-Burton #behaviour #parallel #semantics: Indeterminate Behavior with Determinate Semantics in Parallel Programs (FWB), pp. 340–346.
FPCA-1989-Takayama #performance #proving: Extended Projection — New Method to Extract Efficient Programs from Constructive Proofs (YT), pp. 299–312.
CHI-1989-MaulsbyW: Inducing programs in a direct-manipulation environment (DLM, IHW), pp. 57–62.
KR-1989-RajasekarLM #reasoning: Skeptical Reasoning and Disjunctive Programs (AR, JL, JM), pp. 349–356.
SEKE-1989-Tang #automation #concurrent #infinity #verification: Temporal Theory for Automatic Verification of Infinite State Concurrent Programs (TGT), pp. 134–139.
PLDI-1989-HwuC #c #compilation: Inline Function Expansion for Compiling C Programs (WmWH, PPC), pp. 246–257.
POPL-1989-GaifmanS #composition #logic programming #semantics: Fully Abstract Compositional Semantics for Logic Programs (HG, EYS), pp. 134–142.
POPL-1989-Paulin-Mohring #calculus #proving: Extracting Fω’s Programs from Proofs in the Calculus of Constructions (CPM), pp. 89–104.
ESEC-1989-MorascaP #ada #concurrent #execution #symbolic computation #using #validation: Validation of Concurrent ADA Programs using Symbolic Execution (SM, MP), pp. 469–486.
ICSE-1989-Hsieh #analysis #concurrent: Timing Analysis of Cyclic Concurrent Programs (CSH), pp. 312–318.
ASPLOS-1989-AdamsZ #analysis #set: An Analysis of 8086 Instruction Set Usage in MS DOS Programs (TLA, REZ), pp. 152–160.
ASPLOS-1989-EggersK #parallel #performance: The Effect of Sharing on the Cache and Bus Performance of Parallel Programs (SJE, RHK), pp. 257–270.
CAAP-1989-Deransart #declarative #logic programming #proving: Proofs of Declarative Properties of Logic Programs (PD), pp. 207–226.
CCIPL-1989-BossiC #correctness #logic programming #verification: Verifying Correctness of Logic Programs (AB, NC), pp. 96–110.
CCIPL-1989-Gribomont #concurrent #development: Development of Concurrent Programs: An Example (EPG), pp. 210–224.
CCIPL-1989-Hanus #horn clause #polymorphism #semantics: Horn Clause Programs with Polymorphic Types: Semantics and Resolution (MH), pp. 225–240.
CCIPL-1989-SannellaT #development #ml #towards: Toward Formal Development of ML Programs: Foundations and Methodology (Extended Abstract) (DS, AT), pp. 375–389.
STOC-1989-BlumK #design: Designing Programs That Check Their Work (MB, SK), pp. 86–97.
CSL-1989-Meinel #bound: Ω-Branching Programs of Bounded Width (CM), pp. 242–253.
CSL-1989-Stark89a #logic programming #quantifier: A Quantifier-Free Completion of Logic Programs (RFS), pp. 384–395.
CSL-1989-StepankovaS #logic programming: Stratification of Definite Clause Programs and of General Logic Programs (OS, PS), pp. 396–408.
LICS-1989-GaifmanS #logic programming #proving #semantics: Proof Theory and Semantics of Logic Programs (HG, EYS), pp. 50–62.
NACLP-1989-Bezem #logic programming #termination: Characterizing Termination of Logic Programs with Level Mappings (MB), pp. 69–80.
NACLP-1989-CasanovaGS #logic programming: Computing Answers to Logic Programs with Weak Model Elimination (MAC, RAdTG, AS), pp. 92–114.
NACLP-1989-DevilleB #logic programming #towards: Generalization and Program Schemata: A Step Towards Computer-Aided Construction of Logic Programs (YD, JB), pp. 409–425.
NACLP-1989-DungK #on the: On the Generalized Predicate Completion of Non-Horn Programs (PMD, KK), pp. 587–603.
NACLP-1989-DungK89a #approach #declarative #fixpoint #logic programming #semantics: A Fixpoint Approach to Declarative Semantics of Logic Programs (PMD, KK), pp. 604–625.
NACLP-1989-GaifmanMS #behaviour #concurrent #constraints #logic programming #semantics: Reactive Behaviour Semantics for Concurrent Constraint Logic Programs (HG, MJM, EYS), pp. 553–569.
NACLP-1989-HermenegildoR #correctness #independence #logic programming #on the #performance: On the Correctness and Efficiency of Independent And-Parallelism in Logic Programs (MVH, FR), pp. 369–389.
NACLP-1989-JacobsL #alias #approximate #logic programming #performance: Accurate and Efficient Approximation of Variable Aliasing in Logic Programs (DJ, AL), pp. 154–165.
NACLP-1989-KiferS #logic programming #on the #power of: On the Expressive Power of Annotated Logic Programs (MK, VSS), pp. 1069–1089.
NACLP-1989-Lakhotia #programming #prolog: Incorporating “Programming Techniques” into Prolog Programs (AL), pp. 426–440.
NACLP-1989-MaherR #fixpoint #logic programming: Déjà Vu in Fixpoints of Logic Programs (MJM, RR), pp. 963–980.
NACLP-1989-MarekT #logic programming #semantics: Stable Semantics for Logic Programs and Default Theories (VWM, MT), pp. 243–256.
NACLP-1989-PyoR #logic programming #polymorphism: Inference of Polymorphic Types for Logic Programs (CP, USR), pp. 1115–1132.
NACLP-1989-RajasekarM #semantics: A Stratification Semantics for General Disjunctive Programs (AR, JM), pp. 573–586.
NACLP-1989-SaletoreK #execution #logic programming #parallel #performance: Obtaining First Solutions Faster in AND-OR Parallel Execution of Logic Programs (VAS, LVK), pp. 390–406.
NACLP-1989-SataluriF #logic programming #semantics #specification #using: Semantic Specification Using Logic Programs (SRS, ACF), pp. 772–791.
TAV-1989-Howden #specification #validation: Validating Programs without Specifications (WEH), pp. 2–9.
TAV-1989-RazoukG #logic #realtime #reasoning: Real-Time Interval Logic for Reasoning about Executions of Real-Time Programs (RRR, MMG), pp. 10–19.
PODS-1988-GelderRS #logic programming #semantics #set: Unfounded Sets and Well-Founded Semantics for General Logic Programs (AVG, KAR, JSS), pp. 221–230.
PODS-1988-ImielinskiN #algebra #logic programming: Explicit Control of Logic Programs Through Rule Algebra (TI, SAN), pp. 103–116.
SIGMOD-1988-WolfsonS #distributed #logic programming: Distributed Processing of Logic Programs (OW, AS), pp. 329–336.
SEI-1988-Fairley #re-engineering: The Software Engineering Programs at George Mason University (REF), pp. 64–69.
SEI-1988-SigillitoBL #re-engineering: Software Engineering in the Johns Hopkins University Continuing Professional Programs (VGS, BIB, PHL), pp. 20–31.
ICALP-1988-Weijland #logic programming #semantics: Semantics for Logic Programs without Occur Check (WPW), pp. 710–726.
ALP-1988-Drosten #algebra #case study #comparative #prolog #specification: Translating Algebraic Specifications to Prolog Programs: A Comparative Study (KD), pp. 137–146.
ALP-1988-Pasztor #logic #recursion #semantics #standard: Nonstandard Logics of Recursive Programs and Denotational Semantics (AP), pp. 255–278.
PLDI-1988-Debray #logic programming #optimisation: Unfold/Fold Transformations and Loop Optimization of Logic Programs (SKD), pp. 297–307.
PLDI-1988-MillerC #debugging #parallel #performance: A Mechanism for Efficient Debugging of Parallel Programs (BPM, JDC), pp. 135–144.
PLILP-1988-BarbutiM #logic programming: A Tool to Check the Non-Floundering Logic Programs and Goals (RB, MM), pp. 58–67.
PLILP-1988-BonnierM #logic programming #towards: Towards a Clean Amalgamation of Logic Programs with External Procedures (SB, JM), pp. 20–34.
PLILP-1988-Lindstrom #functional #logic #static analysis: Static Analysis Of Functional Programs With Logic Variables (GL), pp. 1–19.
PLILP-1988-Nilsson #abstract interpretation #framework #logic programming #towards: Towards a Framework for the Abstract Interpretation of Logic Programs (UN), pp. 68–82.
POPL-1988-AlpernWZ #detection #similarity: Detecting Equality of Variables in Programs (BA, MNW, FKZ), pp. 1–11.
POPL-1988-Debray #analysis #data flow #logic programming #performance: Efficient Dataflow Analysis of Logic Programs (SKD), pp. 260–273.
POPL-1988-HorwitzPR: Integrating Non-Interfering Versions of Programs (SH, JP, TWR), pp. 133–145.
POPL-1988-HorwitzPR88a #dependence #graph #on the #representation: On the Adequacy of Program Dependence Graphs for Representing Programs (SH, JP, TWR), pp. 146–157.
POPL-1988-Lam #array #compilation #optimisation: Compiler Optimizations for Asynchronous Systolic Array Programs (MSL), pp. 309–318.
ICSE-1988-Mano #generative #modelling #reuse: Modeling of Data-Processing Software for Generating and Reusing Their Programs (NM), pp. 231–240.
PPEALS-1988-DavisH #behaviour #parallel: Characterizing the Synchronization Behavior of Parallel Programs (HD, JLH), pp. 198–211.
PPEALS-1988-LarusH #concurrent #execution #lisp: Restructuring Lisp Programs for Concurrent Execution (JRL, PNH), pp. 100–110.
PPEALS-1988-QuinnHJ #compilation #multi: Compiling C* Programs for a Hypercube Multicomputer (MJQ, PJH, KCJ), pp. 57–65.
ESOP-1988-JacobsL #compilation #logic programming #strict: Compilation of Logic Programs for Restricted And-Parallelism (DJ, AL), pp. 284–297.
ESOP-1988-Wadler #deforestation #named: Deforestation: Transforming Programs to Eliminate Trees (PW), pp. 344–358.
STOC-1988-CosmadakisGKV #database #decidability #logic programming #optimisation #problem: Decidable Optimization Problems for Database Logic Programs (SSC, HG, PCK, MYV), pp. 477–490.
STOC-1988-Yannakakis #combinator #linear #optimisation #problem: Expressing Combinatorial Optimization Problems by Linear Programs (MY), pp. 223–228.
CADE-1988-MinkerR #logic programming: Procedural Interpretation of Non-Horn Logic Programs (JM, AR), pp. 278–293.
CADE-1988-WosM #automation #challenge #combinator #logic #problem #similarity: Challenge Problems Focusing on Equality and Combinatory Logic: Evaluating Automated Theorem-Proving Programs (LW, WM), pp. 714–729.
CSL-1988-BuningLS #detection #prolog: Loop Detection in Propositional Prolog Programs (HKB, UL, SS), pp. 148–165.
CSL-1988-OchozkaSS #complexity #logic programming #normalisation: Normal Forms and the Complexity of Computations of Logic Programs (VO, OS, PS), pp. 357–371.
CSL-1988-Plumer #automation #prolog #proving #termination: Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs (LP), pp. 254–271.
CSL-1988-Wagner #automaton #logic #on the #problem: On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs (HW), pp. 384–399.
JICSCP-1988-AptB88 #classification #modelling: Arithmetic Classification of Perfect Models of Stratified Programs (KRA, HAB), pp. 765–779.
JICSCP-1988-AttilaF88 #attribute grammar #execution #semantics: Unification-Free Execution of TYPOL Programs by Semantic Attribute Evaluation (IA, PFZ), pp. 160–177.
JICSCP-1988-BatarekhS88 #logic programming #semantics: Semantical Equivalences of (Non-Classical) Logic Programs (AB, VSS), pp. 960–977.
JICSCP-1988-BiswasSY88 #automaton #logic programming #parallel #scalability #strict: A Scalable Abstract Machine Model to Support Limited-OR (LOR) / Restricted-AND Parallelism (RAP) in Logic Programs (PB, SCS, DYYY), pp. 1160–1179.
JICSCP-1988-BonnierM88 #logic programming #towards: Towards a Clean Amalgamation of Logic Programs with External Procedures (SB, JM), pp. 311–326.
JICSCP-1988-Debray88 #logic programming #parallel #static analysis: Static Analysis of Parallel Logic Programs (SKD), pp. 711–732.
JICSCP-1988-ElkanM88 #automation #induction #logic programming #reasoning: Automated Inductive Reasoning about Logic Programs (CE, DAM), pp. 876–892.
JICSCP-1988-Fribourg88 #induction #prolog: Equivalence-Preserving Transformations of Inductive Properties of Prolog Programs (LF), pp. 893–908.
JICSCP-1988-FujitaOF88 #constraints #haskell #partial evaluation: Partial Evaluation of GHC Programs Based on the UR-set with Constraints (HF, AO, KF), pp. 924–941.
JICSCP-1988-GorlickK88 #analysis #logic programming #named #performance: Gauge: A Workbench for the Performance Analysis of Logic Programs (MMG, CK), pp. 548–561.
JICSCP-1988-KaleRS88 #execution #independence #logic programming #memory management #parallel: A Memory Organization Independent Binding Environment for AND and OR Parallel Execution of Logic Programs (LVK, RR, WWS), pp. 1223–1240.
JICSCP-1988-Kaplan88 #algorithm #complexity #logic programming: Algorithmic Complexity of Logic Programs (SK), pp. 780–793.
JICSCP-1988-KwokS88 #logic programming: Implicit Definition of Logic Programs (CSK, MJS), pp. 374–385.
JICSCP-1988-LinK88 #execution #logic programming #memory management #multi #summary: AND-Parallel Execution of Logic Programs on a Shared Memory Multiprocessor: A Summary of Results (YJL, VK), pp. 1123–1141.
JICSCP-1988-LoboMR88: Weak Completion Theory for Non-Horn Programs (JL, JM, AR), pp. 828–842.
JICSCP-1988-MancarellaP88 #algebra #logic programming: An Algebra of Logic Programs (PM, DP), pp. 1006–1023.
JICSCP-1988-MarriottNL88 #logic programming: Most Specific Logic Programs (KM, LN, JLL), pp. 909–923.
JICSCP-1988-MarriottS88 #abstract interpretation #bottom-up #logic programming: Bottom-up Abstract Interpretation of Logic Programs (KM, HS), pp. 733–748.
JICSCP-1988-NgL88 #contest #execution #logic programming #parallel: The Competition Model for Parallel Execution of Logic Programs (KWN, HfL), pp. 1180–1187.
JICSCP-1988-ParkerM88 #formal method #logic programming: A Theory of Directed Logic Programs and Streams (DSPJ, RRM), pp. 620–650.
JICSCP-1988-PrzymusinskaP88 #logic programming #semantics: Weakly Perfect Model Semantics for Logic Programs (HP, TCP), pp. 1106–1120.
JICSCP-1988-Ramakrishnan88 #approach #logic programming: Magic Templates: A Spellbinding Approach to Logic Programs (RR), pp. 140–159.
JICSCP-1988-SekiI88 #evaluation #query: A Query Evaluation Method for Stratified Programs Under the Extended CWA (HS, HI), pp. 195–211.
JICSCP-1988-TsengB88 #data-driven #execution #logic programming #parallel: A Data-Driven Parallel Execution Model for Logic Programs (CCT, PB), pp. 1204–1222.
JICSCP-1988-WarrenHD88 #analysis #logic programming #on the: On the Practicality of Global Flow Analysis of Logic Programs (RW, MVH, SKD), pp. 684–699.
LICS-1988-Baudinet #approach #prolog #proving #semantics #termination: Proving Termination Properties of Prolog Programs: A Semantic Approach (MB), pp. 336–347.
HT-1987-BigelowR: Manipulating Source Code in DynamicDesign (JB, VAR), pp. 397–408.
PODS-1987-BeeriKBR #bound #logic programming: Bounds on the Propagation of Selection into Logic Programs (CB, PCK, FB, RR), pp. 214–226.
PODS-1987-Hegner #database #implementation #specification: Specification and Implementation of Programs for Updating Incomplete Information Databases (SJH), pp. 146–158.
PODS-1987-Sagiv #datalog #optimisation: Optimizing Datalog Programs (YS), pp. 349–362.
VLDB-1987-FreytagCK #database: Masking System Crashes in Database Application Programs (JCF, FC, BK), pp. 407–416.
VLDB-1987-Gardarin #datalog #recursion: Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs (GG), pp. 21–30.
RTA-1987-Strandh #equation #optimisation: Optimizing Equational Programs (RS), pp. 13–24.
FPCA-1987-Goldberg #detection #functional: Detecting sharing of partial applications in functional programs (BG), pp. 408–425.
FPCA-1987-HudakA #functional #parallel: Pomset interpretations of parallel functional programs (PH, SA), pp. 234–256.
FPCA-1987-Schlag #functional: The planar topology of functional programs (MDFS), pp. 174–193.
FPCA-1987-WatsonW #functional: Evaluating functional programs on the FLAGSHIP machine (PW, IW), pp. 80–97.
PLDI-1987-Barklund #performance #prolog: Efficient interpretation of Prolog programs (JB), pp. 132–137.
PLDI-1987-Boehm: Constructive real interpretation of numerical programs (HJB), pp. 214–221.
PLDI-1987-ChaseH #debugging: Selective interpretation as a technique for debugging computationally intensive programs (BBC, RTH), pp. 113–124.
PLDI-1987-KarinthiW #incremental: Incremental re-execution of programs (RK, MW), pp. 38–44.
POPL-1987-AllenCK #automation #composition #execution #parallel: Automatic Decomposition of Scientific Programs for Parallel Execution (RA, DC, KK), pp. 63–76.
POPL-1987-MannaP #concurrent #specification #verification: Specification and Verification of Concurrent Programs By Forall-Automata (ZM, AP), pp. 1–12.
ESEC-1987-Conradi #documentation #experience #fault #fortran #verification: Experience with Fortran Verifier. A Tool for Documentation and Error Diagnosis of Fortran-77 Programs (RC), pp. 263–275.
ICSE-1987-Benington #scalability: Production of Large Computer Programs (HDB), pp. 299–310.
ICSE-1987-Lehman #modelling #process #programming: Process Models, Process Programs, Programming Support (MML), pp. 14–16.
ICSE-1987-Winkler #product line #scalability #version control: Version Control in Families of Large Programs (JFHW), pp. 150–165.
CAAP-1987-SannellaT #algebra #development #implementation #specification #towards: Toward Formal Development of Programs from Algebraic Specifications: Implementations Revisited (Extended Abstract) (DS, AT), pp. 96–110.
CAAP-1987-Wegener #branch #clique #complexity #on the: On the Complexity of Branching Programs and Decision Trees for Clique Functions (IW), pp. 1–12.
CFLP-1987-BarbutiMPT #implementation #logic programming: Intensional Negation of Logic Programs: Examples and Implementation Techniques (RB, PM, DP, FT), pp. 96–110.
CFLP-1987-DrabentM #induction #logic programming: Inductive Assertion Method for Logic Programs (WD, JM), pp. 167–181.
CSL-1987-StepankovaS #logic programming #normalisation: Developing Logic Programs: Computing Through Normalizing (OS, PS), pp. 304–321.
ICLP-1987-CecchiSA87 #logic programming: Evaluating Logic Programs via Set-Valued Functions (CC, DS, LCA), pp. 428–455.
ICLP-1987-DiszLO87 #logic programming: Experiments with OR-Parallel Logic Programs (TD, ELL, RAO), pp. 576–600.
ICLP-1987-Helm87 #deduction #induction #logic programming: Inductive and Deductive Control of Logic Programs (RH), pp. 488–512.
ICLP-1987-Hermenegildo87 #execution #logic programming #memory management #precedence: Relating Goal-Scheduling, Precedence, and Memory Management in AND-Parallel Execution of Logic Programs (MVH), pp. 556–575.
ICLP-1987-Kale87 #evaluation #logic programming #parallel #process: The REDUCE-OR Process Model for Parallel Evaluation of Logic Programs (LVK), pp. 616–632.
ICLP-1987-KanamoriH87 #logic programming: Construction of Logic Programs Based on Generalized Unfold/Fold Rules (TK, KH), pp. 744–768.
ICLP-1987-Maher87 #logic #semantics: Logic Semantics for a Class of Committed-Choice Programs (MJM), pp. 858–876.
ICLP-1987-ShmueliN87 #horn clause #set: Set Grouping and Layering in Horn Clause Programs (OS, SAN), pp. 152–177.
ICLP-1987-Somogyi87 #logic programming #modelling #precise: A System of Precise Models for Logic Programs (ZS), pp. 769–787.
ICLP-1987-Ueda87: Making Exhaustive Search Programs Deterministic, Part II (KU), pp. 356–375.
ICLP-1987-Zobel87 #polymorphism #prolog: Derivation of Polymorphic Types for PROLOG Programs (JZ), pp. 817–838.
LICS-1987-GaifmanMSV #database #decidability #logic programming #optimisation #problem: Undecidable Optimization Problems for Database Logic Programs (HG, HGM, YS, MYV), pp. 106–115.
LICS-1987-KfouryTU #functional: The Hierarchy of Finitely Typed Functional Programs (AJK, JT, PU), pp. 225–235.
LICS-1987-Vardi #concurrent #framework #verification: Verification of Concurrent Programs: The Automata-Theoretic Framework (MYV), pp. 167–176.
SLP-1987-BruynoogheJCD87 #abstract interpretation #optimisation #prolog #towards: Abstract Interpretation: Towards the Global Optimization of Prolog Programs (MB, GJ, AC, BD), pp. 192–204.
SLP-1987-Conery87 #logic programming #memory management #parallel: Binding Environments for Parallel Logic Programs in Non-Shared Memory Multiprocessors (JSC), pp. 457–467.
SLP-1987-Debray87 #analysis #logic programming: Flow Analysis of a Simple Class of Dynamic Logic Programs (SKD), pp. 307–316.
SLP-1987-DiszL87 #behaviour #logic programming #parallel #visual notation: A Graphical Tool for Observing the Behavior of Parallel Logic Programs (TD, ELL), pp. 46–53.
SLP-1987-Drabent87 #logic programming #question: Do Logic Programs Resemble Programs in Conventional Languages? (WD), pp. 289–396.
SLP-1987-GorlickK87 #prolog: Timing Prolog Programs without Clock (MMG, CK), pp. 426–434.
SLP-1987-KishimotoHKH87 #evaluation: An Evaluation of the FGHC via Practical Application Programs (MK, AH, KK, AH), pp. 516–525.
SLP-1987-MannilaU87 #analysis #prolog: Flow Analysis of Prolog Programs (HM, EU), pp. 205–214.
SLP-1987-MillerN87 #approach #logic programming: A Logic Programming Approach to Manipulating Formulas and Programs (DM, GN), pp. 379–388.
SLP-1987-SannellaW87 #calculus #composition #prolog: A Calculus for the Construction of Modular Prolog Programs (DS, LAW), pp. 368–378.
SLP-1987-SekiF87 #logic programming: Notes on Transformation Techniques for Generate and Test Logic Programs (HS, KF), pp. 215–223.
SLP-1987-Subrahmanian87 #logic programming #on the #semantics: On the Semantics of Quantitative Logic Programs (VSS), pp. 173–182.
SLP-1987-Takayama87 #compilation #prolog #proving: Writing Programs as QJ Proof and Compiling into Prolog Programs (YT), pp. 278–287.
PODS-1986-BancilhonMSU #logic programming #set: Magic Sets and Other Strange Ways to Implement Logic Programs (FB, DM, YS, JDU), pp. 1–15.
SIGMOD-1986-FreytagG #query #relational #rule-based: Rule-Based Translation of Relational Queries into Iterative Programs (JCF, NG), pp. 206–214.
SIGMOD-1986-GardarinM #database #evaluation #logic programming #recursion: Evaluation of Database Recursive Logic Programs as Recurrent Function Series (GG, CdM), pp. 177–186.
VLDB-1986-Freytag #query: Translating Aggregate Queries into Iterative Programs (JCF, NG), pp. 138–146.
ICALP-1986-RosierY #complexity #concurrent #finite #on the #probability #termination: On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs (LER, HCY), pp. 334–343.
LFP-1986-SarkarH #clustering #parallel: Partitioning Parallel Programs for Macro-Dataflow (VS, JLH), pp. 202–211.
OOPSLA-1986-CunninghamB #diagrams #object-oriented: A Diagram for Object-Oriented Programs (WC, KB), pp. 361–367.
POPL-1986-JonesM #analysis #data flow #graph #using: Data Flow Analysis of Applicative Programs Using Minimal Function Graphs (NDJ, AM), pp. 296–306.
POPL-1986-Wolper #logic: Expressing Interesting Properties of Programs in Propositional Temporal Logic (PW), pp. 184–193.
DAC-1986-Kruger #automation #design #generative #self: Automatic generation of self-test programs — a new feature of the MIMOLA design system (GK), pp. 378–384.
ESOP-1986-CodognetCF #backtracking #logic programming: A Very Intelligent Backtracking Method for Logic Programs (CC, PC, GF), pp. 315–326.
ESOP-1986-MelloN #communication #prolog: Programs as Collections of Communicating Prolog Units (PM, AN), pp. 274–288.
ESOP-1986-SchwinnB #execution #logic programming: An And-Parallel Execution Model of Logic Programs (BS, GB), pp. 289–300.
ESOP-1986-Sondergaard #abstract interpretation #logic programming #reduction: An Application of Abstract Interpretation of Logic Programs: Occur Check Reduction (HS), pp. 327–338.
ESOP-1986-TrioletFI #automation #fortran #parallel: Automatic Parallelization of Fortran Programs in the Presence of Procedure Calls (RT, PF, FI), pp. 210–222.
STOC-1986-AjtaiBHKPRST #bound #branch: Two lower bounds for branching programs (MA, LB, PH, JK, PP, VR, ES, GT), pp. 30–38.
STOC-1986-Barrington #bound #branch: Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ (DAMB), pp. 1–5.
STOC-1986-CourcoubetisVW #concurrent #reasoning: Reasoning about Fair Concurrent Programs (CC, MYV, PW), pp. 283–294.
CADE-1986-KanamoriF #induction #prolog #verification: Formulation of Induction Formulas in Verification of Prolog Programs (TK, HF), pp. 281–299.
CADE-1986-Traugott86a #deduction #sorting #synthesis: Deductive Synthesis of Sorting Programs (JT), pp. 641–660.
CADE-1986-Weispfenning #logic #recursion: Diamond Formulas in the Dynamic Logic of Recursively Enumerable Programs (VW), pp. 564–571.
ICLP-1986-BarbutiM86 #logic programming: Completeness of the SLDNF-resolution for a class of logic programs (RB, MM), pp. 600–614.
ICLP-1986-ChengzhengY86 #execution #logic programming: The OR-Forest Description for the Execution of Logic Programs (CS, TY), pp. 710–717.
ICLP-1986-Hermenegildo86 #automaton #execution #logic programming #strict: An Abstract Machine for Restricted AND-Parallel Execution of Logic Programs (MVH), pp. 25–39.
ICLP-1986-KanamoriS86 #execution #prolog #using #verification: Verification of Prolog Programs Using an Extension of Execution (TK, HS), pp. 475–489.
ICLP-1986-LinKL86 #algorithm #backtracking #execution #logic programming #parallel: An Intelligent Backtracking Algorithm for Parallel Execution of Logic Programs (YJL, VK, CHCL), pp. 55–68.
ICLP-1986-Maher86 #logic programming: Eqivalences of Logic Programs (MJM), pp. 410–424.
ICLP-1986-Mellish86 #abstract interpretation #prolog: Abstract Interpretation of Prolog Programs (CM), pp. 463–474.
ICLP-1986-StepanekS86 #logic programming: Logic Programs and Alternation (PS, OS), pp. 99–106.
ICLP-1986-Tick86 #lisp #memory management #performance #prolog: Memory Performance of Lisp and Prolog Programs (ET), pp. 642–649.
ICLP-1986-Ueda86: Making Exhaustive Search Programs Deterministic (KU), pp. 270–282.
LICS-1986-BeckmanGW #algebra #execution #logic programming #parallel: An Algebraic Model of Parallel Execution of Logic Programs (LB, RG, AW), pp. 50–57.
LICS-1986-Mason #equivalence #first-order #lisp #proving: Equivalence of First Order LISP Programs. Proving Properties of Destructive Programs via Transformation (IAM), pp. 105–117.
LICS-1986-Plaisted #nondeterminism #recursion #semantics #using: The Denotional Semantics of Nondeterministic Recursive Programs using Coherent Relations (DAP), pp. 163–174.
SLP-1986-BarklundM86 #garbage collection #prolog: Garbage Cut for Garbage Collection of Iterative Prolog Programs (JB, HM), pp. 276–283.
SLP-1986-CiepielewskiH86 #evaluation #execution #logic programming #performance: Performance Evaluation of a Storage Model for OR--Parallel Execution of Logic Programs (AC, BH), pp. 246–257.
SLP-1986-DebrayW86 #automation #prolog: Automatic Mode Inference for Prolog Programs (SKD, DSW), pp. 78–88.
SLP-1986-Gelder86 #logic programming #using: Negation as Failure Using Tight Derivations for General Logic Programs (AVG), pp. 127–138.
SLP-1986-VasakP86 #logic programming: Characterisation of Terminating Logic Programs (TV, JP), pp. 140–147.
VLDB-1985-Mendelzon #dependence #functional #logic programming: Functional Dependencies in Logic Programs (AOM), pp. 324–330.
ICALP-1985-Hortala-GonzalezR #hoare #logic #nondeterminism #standard #theorem: Hoare’s Logic for Nondeterministic Regular Programs: A Nonstandard Completeness Theorem (MTHG, MRA), pp. 270–280.
FPCA-1985-BushG85 #execution #parallel #recursion: Transforming Recursive Programs for Execution on Parallel Machines (VJB, JRG), pp. 350–367.
FPCA-1985-Debray85 #optimisation #prolog #recursion: Optimizing Almost-Tail-Recursive Prolog Programs (SKD), pp. 204–219.
FPCA-1985-Johnsson85 #equation #recursion: λ Lifting: Treansforming Programs to Recursive Equations (TJ), pp. 190–203.
POPL-1985-Leivant #imperative #logic #reasoning: Logical and Mathematical Reasoning about Imperative Programs (DL), pp. 132–140.
POPL-1985-LichtensteinP #concurrent #finite #linear #specification: Checking That Finite State Concurrent Programs Satisfy Their Linear Specification (OL, AP), pp. 97–107.
ICSE-1985-HedleyH: The Causes and Effects of Infeasible Paths in Computer Programs (DH, MAH), pp. 259–267.
ICSE-1985-ShimizuS #automation #embedded #multi #realtime: Automatic Tuning of Multi-Task Programs for Real-Time Embedded Systems (TS, KS), pp. 350–357.
SOSP-1985-Cooper #distributed: Replicated Distributed Programs (ECC), pp. 63–78.
SOSP-1985-MalkawiP #compilation #memory management #policy: Compiler Directed Memory Management Policy For Numerical Programs (MM, JHP), pp. 97–106.
CSE-1985-Gribomont #invariant #parallel #synthesis: Synthesis of Parallel Programs Invariants (EPG), pp. 325–338.
STOC-1985-AharoniEL #integer #linear: Dual Integer Linear Programs and the Relationship between their Optima (RA, PE, NL), pp. 476–483.
STOC-1985-Kaltofen: Computing with Polynomials Given by Straight-Line Programs I: Greatest Common Divisors (EK), pp. 131–142.
STOC-1985-VardiS #bound #logic: Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary Report (MYV, LJS), pp. 240–251.
SLP-1985-ChomickiM85 #programming #prolog #scalability #towards: Towards a Programming Environment for Large Prolog Programs (JC, NHM), pp. 230–241.
SLP-1985-DembinskiM85 #backtracking #logic programming: AND-Parallelism with Intelligent Backtracking for Annotated Logic Programs (PD, JM), pp. 29–38.
SLP-1985-MaluszynskiK85 #execution #logic programming: Unification-Free Execution of Logic Programs (JM, HJK), pp. 78–86.
SLP-1985-OKeefe85a #algebra #logic programming #towards: Towards an Algebra for Constructing Logic Programs (RAO), pp. 152–160.
LFP-1984-Pettorossi #performance: A Powerful Strategy for Deriving Efficient Programs by Transformation (AP), pp. 273–281.
LFP-1984-Smolka #data flow #logic programming: Making Control and Data Flow in Logic Programs Explicit (GS), pp. 311–322.
POPL-1984-MishraK #static analysis: Static Inference of Properties of Applicative Programs (PM, RMK), pp. 235–244.
POPL-1984-SubrahmanyamY #evaluation #functional #lazy evaluation #logic programming #reduction: Pattern Driven Lazy Reduction: A Unifying Evaluation Mechanism for Functional and Logic Programs (PAS, JHY), pp. 228–234.
ICSE-1984-Friman #generative #named: MGEN — A Generator for Menu Driven Programs (BF), pp. 198–206.
ICSE-1984-MohriOUTS #design #implementation #named: PDAS: An Assistant for Detailed Design and Implementation of Programs (TM, EO, SU, TT, HS), pp. 108–115.
STOC-1984-VardiW #automaton #logic: Automata Theoretic Techniques for Modal Logics of Programs (MYV, PW), pp. 446–456.
ILPC-1984-Johansson84 #logic programming #symmetry #using: Using Symmetry for the Derivation of Logic Programs (ALJ), pp. 243–251.
ILPC-1984-Nakamura84 #concurrent #evaluation #logic programming: Associative Concurrent Evaluation of Logic Programs (KN), pp. 321–331.
ILPC-1984-Sintzoff84 #bound #strict: Bounded-Horizon Success-Complete Restriction of Inference Programs (MS), pp. 139–150.
ILPC-1984-StepankovaS84 #logic programming: Computation Trees and Transformations of Logic Programs (OS, PS), pp. 53–63.
ILPC-1984-TamakiS84 #logic programming: Unfold/Fold Transformation of Logic Programs (HT, TS), pp. 127–138.
ILPC-1984-WolframML84 #logic programming: A Unified Treatment of Resolution Strategies for Logic Programs (DAW, MJM, JLL), pp. 263–276.
SLP-1984-Kahn84 #logic programming: A Primitive for the Control of Logic Programs (KMK), pp. 242–251.
SLP-1984-Reddy84 #functional #logic programming: Transformation of Logic Programs into Functional Programs (USR), pp. 187–196.
SLP-1984-WarrenADK84 #distributed #network #prolog: Executing Distributed Prolog Programs on a Broadcast Network (DSW, MA, SKD, LVK), pp. 12–21.
ICALP-1983-SatoT #logic programming: Enumeration of Success Patterns in Logic Programs (TS, HT), pp. 640–652.
POPL-1983-CunyS #compilation #data-driven #execution: Compilation of Data-Driven Programs for Synchronous Execution (JEC, LS), pp. 197–202.
SOSP-1983-ReidK #file system: A File System Supporting Cooperation between Programs (LGR, PLK), pp. 20–19.
STOC-1983-BorodinDFP #bound #branch: Bounds for Width Two Branching Programs (AB, DD, FEF, WJP), pp. 87–93.
STOC-1983-Olderog #hoare #logic: A Characterization of Hoare’s Logic for Programs with Pascal-like Procedures (ERO), pp. 320–329.
SIGMOD-1982-Bell #modelling #simulation: Data Modelling of Scientific Simulation Programs (JLB), pp. 79–86.
LFP-1982-CohenM #algebra #nondeterminism #towards: Toward an Algebra of Nondeterministic Programs (ATC, TJM), pp. 235–242.
POPL-1982-DamasM #functional: Principal Type-Schemes for Functional Programs (LD, RM), pp. 207–212.
POPL-1982-HailpernO #composition #concurrent #verification: Modular Verification of Concurrent Programs (BH, SSO), pp. 322–336.
POPL-1982-HartSP #concurrent #probability #termination: Termination of Probabilistic Concurrent Programs (SH, MS, AP), pp. 1–6.
POPL-1982-JonesM #analysis #approach #data flow #data type #flexibility #interprocedural #recursion: A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures (NDJ, SSM), pp. 66–74.
POPL-1982-LiskovS #distributed #robust: Guardians and Actions: Linguistic Support for Robust, Distributed Programs (BL, RS), pp. 7–19.
POPL-1982-MeyerM #axiom #recursion: Axiomatic Definability and Completeness for Recursive Programs (ARM, JCM), pp. 337–346.
SCC-1982-RudmikM #compilation #performance #scalability: An Efficient Separate Compilation Strategy for Very Large Programs (AR, BGM), pp. 301–307.
ICSE-1982-Abu-SufahLMY #behaviour: Experimental Results on the Paging Behavior of Numerical Programs (WAAS, RL, MM, PY), pp. 110–119.
ICSE-1982-Ling #design #diagrams #using: Designing Data Entry Programs Using State Diagram as a Common Model (MML), pp. 296–308.
ICSE-1982-PetroneLS #interactive #named: DUAL: An Interactive Tool for Developing Documented Programs by Step-Wise Refinements (LP, ADL, FS), pp. 350–359.
ICSE-1982-WarrenMH #experience #pascal #quality: Experience with a Module Package in Developing Production Quality PASCAL Programs (SW, BEM, CH), pp. 246–253.
DAC-1982-BellonLSSVGI #automation #generative: Automatic generation of microprocessor test programs (CB, AL, SS, GS, RV, FG, MI), pp. 566–573.
DAC-1982-TakashimaMCY #verification: Programs for verifying circuit connectivity of mos/lsi mask artwork (MT, TM, TC, KY), pp. 544–550.
CADE-1982-Goad #automation: Automatic Construction of Special Purpose Programs (CG), pp. 194–208.
ILPC-1982-BarbutiDL82 #logic programming #proving #towards: Toward an Inductionless Technique for Proving Properties of Logic Programs (RB, PD, GL), pp. 175–181.
ILPC-1982-Bruynooghe82a #prolog #reliability: Adding Redundancy to Obtain more Reliable and Readable Prolog Programs (MB), pp. 129–133.
ILPC-1982-Emden82 #algorithm #prolog: An Algorithm for Interpreting Prolog Programs (MHvE), pp. 56–64.
ILPC-1982-Kahn82 #lisp #prolog: A Partial Evaluator of Lisp Programs Written in Prolog (KMK), pp. 19–25.
ILPC-1982-Morris82 #logic programming #relational: Relational Production Systems and Logic Programs (PHM), pp. 187–192.
ILPC-1982-Sato82 #prolog #semantics: Negation and Semantics of Prolog Programs (TS), pp. 169–174.
ILPC-1982-SebelikS82 #graph #prolog: Graphs as Data in Prolog Programs (JS, PS), pp. 105–109.
ILPC-1982-Shapiro82 #complexity #logic programming: Alternation and the Computational Complexity of Logic Programs (EYS), pp. 154–163.
ICALP-1981-Sharir #analysis #data flow: Data Flow Analysis of Applicative Programs (MS), pp. 98–113.
PS-1981-ColemanG #correctness #distributed: Partial Correctness of Distributed Programs (DC, RMG), pp. 138–180.
PS-1981-ColemanG81a #distributed #specification: Specification of Distributed Programs (DC, RMG), pp. 181–214.
ICSE-1981-Dershowitz #abstraction #evolution: The Evolution of Programs: Program Abstraction and Instantiation (ND), pp. 79–89.
ICSE-1981-FutamuraKHT #analysis #development #diagrams #problem: Development of Computer Programs by Problem Analysis Diagram (PAD) (YF, TK, HH, MT), pp. 325–332.
DAC-1981-SakauyeLRETSABW #design #set: A set of programs for MOS design (GS, AL, JR, RE, JT, ESYS, EA, FB, PSW), pp. 435–442.
SOSP-1981-BernsteinH #logic #proving #realtime: Proving Real-Time Properties of Programs with Temporal Logic (AJB, PKHJ), pp. 1–11.
STOC-1981-JosephY #modelling #performance #polynomial: Fast Programs for Initial Segments and Polynomial Time Computation in Weak Models of Arithmetic (DJ, PY), pp. 55–61.
ICALP-1980-EmersonC #correctness #fixpoint #parallel #using: Characterizing Correctness Properties of Parallel Programs Using Fixpoints (EAE, EMC), pp. 169–181.
POPL-1980-BuddDLS #correctness #functional #using: Theoretical and Emperical Studies on Using Program Mutation to Test the Functional Correctness of Programs (TAB, RAD, RJL, FGS), pp. 220–233.
POPL-1980-Kfoury #analysis #set: Analysis of Simple Programs Over Different Sets of Primitives (AJK), pp. 56–61.
POPL-1980-Lamport #logic #quote: “Sometime” is Sometimes “Not Never” — On the Temporal Logic of Programs (LL), pp. 174–185.
POPL-1980-Parikh #complexity #logic #modelling: Propositional Logics of Programs: Systems, Models, and Complexity (RP), pp. 186–192.
STOC-1980-IbarraL #complexity #equivalence #problem: The Complexity of the Equivalence Problem for Straight-Line Programs (OHI, BSL), pp. 273–280.
STOC-1980-Yap #first-order #problem #trade-off: Space-time Tradeoffs and First Order Problems in a Model of Programs (CKY), pp. 318–325.
CADE-1980-Bruynooghe #analysis #behaviour #dependence #logic programming: Analysis of Dependencies to Improve the Behaviour of Logic Programs (MB), pp. 293–305.
CADE-1980-Kott #proving #recursion: A System for Proving Equivalences of Recursive Programs (LK), pp. 63–69.
CADE-1980-OverbeekL #architecture #data type #implementation: Data Structures and Control Architectures for Implementation of Theorem-Proving Programs (RAO, ELL), pp. 232–249.
CADE-1980-PereiraP #backtracking #logic programming: Selective Backtracking for Logic Programs (LMP, AP), pp. 306–317.
ICALP-1979-Istrail #fixpoint #monad #recursion #semantics #theorem: A Fixed-Point Theorem for Recursive-Enumerable Languages and Some Considerations About Fixed-Point Semantics of Monadic Programs (SI), pp. 289–303.
ICALP-1979-KowalkV #on the #parallel #reduction: On Reductions of Parallel Programs (WK, RV), pp. 356–369.
ICALP-1979-MannaP #logic: The Modal Logic of Programs (ZM, AP), pp. 385–409.
ICALP-1979-Schmidt #graph: Investigating Programs in Terms of Partial Graphs (GS), pp. 505–519.
POPL-1979-Clarke #concurrent #invariant #synthesis: Synthesis of Resource Invariants for Concurrent Programs (EMC), pp. 211–221.
POPL-1979-Cohen #recursion: Characterization and Elimination of Redundancy in Recursive Programs (NHC), pp. 143–157.
POPL-1979-Fong #automation: Automatic Improvement of Programs in Very High Level Languages (ACF), pp. 21–28.
POPL-1979-GoodC #proving: Principles of Proving Programs Correct in Gypsy (DIG, RMC, JKW), pp. 42–52.
POPL-1979-Harel #logic #recursion: Recursion in Logics of Programs (DH), pp. 81–92.
POPL-1979-ReitmanA #approach #axiom #data flow: Certifying Information Flow Properties of Programs: An Axiomatic Approach (RPR, GRA), pp. 283–290.
ICSE-1979-Cohen: Computer-Aided Micro-Analysis of Programs (JC), pp. 79–84.
ICSE-1979-RiddleBDE #concurrent #detection: Anomaly Detection in Concurrent Programs (WER, GB, CD, BE), pp. 265–273.
ICSE-1979-Scowen #quality: A New Technique for Improving the Quality of Computer Programs (RSS), pp. 73–78.
ICSE-1979-Wertz: A System to Improve incorrect Programs (HW), pp. 286–293.
STOC-1979-GurariI #complexity #equivalence #linear #problem #set: The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs (EMG, OHI), pp. 142–152.
ICALP-1978-Gallier #correctness #nondeterminism #recursion #semantics: Semantics and Correctness of Nondeterministic Flowchart Programs with Recursive Procedures (JHG), pp. 251–267.
ICALP-1978-Harel #logic: Arithmetical Completeness in Logics of Programs (DH), pp. 268–288.
GG-1978-RosendahlM #analysis #reduction: Analysis of Programs by Reduction of Their Structure (MR, KPM), pp. 409–417.
POPL-1978-HarelP #logic #nondeterminism: Nondeterminism in Logics of Programs (DH, VRP), pp. 203–213.
POPL-1978-Kosinki #data flow #semantics: A Straightforward Denotational Semantics for Non-Determinant Data Flow Programs (PRK), pp. 214–221.
ICSE-1978-MannaW #synthesis: The Synthesis of Structure Changing Programs (ZM, RJW), pp. 175–187.
STOC-1978-RaoultV #equivalence #recursion #semantics: Operational and Semantic Equivalence between Recursive Programs (JCR, JV), pp. 75–85.
ICALP-1977-ChytilJ #composition #finite #string #transducer: Serial Composition of 2-Way Finite-State Transducers and Simple Programs on Strings (MC, VJ), pp. 135–147.
ICALP-1977-PnueliS #problem: Simple Programs and Their Decision Problems (AP, GS), pp. 380–390.
POPL-1977-BerryL #recursion: Minimal and Optimal Computations of Recursive Programs (GB, JJL), pp. 215–226.
POPL-1977-CousotC #abstract interpretation #approximate #fixpoint #static analysis: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints (PC, RC), pp. 238–252.
POPL-1977-DeMilloLP #process #proving #social #theorem: Social Processes and Proofs of Theorems and Programs (RAD, RJL, AJP), pp. 206–214.
POPL-1977-DershowitzM #automation #evolution: The Evolution of Programs: A System for Automatic Program Modification (ND, ZM), pp. 144–154.
SOSP-1977-BabonneauAMM #adaptation #automation: Automatic and General Solution to the Adaption of Programs in a Paging Environment (JYB, MSA, GM, MBM), pp. 109–116.
STOC-1977-FischerL #logic: Propositional Modal Logic of Programs (MJF, REL), pp. 286–294.
STOC-1977-HarelMP #logic: Computability and Completeness in Logics of Programs (DH, ARM, VRP), pp. 261–268.
STOC-1977-HarelPS #axiom #deduction #proving #recursion: A Complete Axiomatic System for Proving Deductions about Recursive Programs (DH, AP, JS), pp. 249–260.
ICALP-1976-Bakker #nondeterminism #recursion #semantics #termination: Semantics and Termination of Nondeterministic Recursive Programs (JWdB), pp. 435–477.
ICALP-1976-Brand #proving: Proving Programs Incorrect (DB), pp. 201–227.
ICALP-1976-Cartwright #data type #lisp #verification: User-Defined Data Types as an Aid to Verifying LISP Programs (RC), pp. 228–256.
ICALP-1976-Emden #verification: Verification Conditions as Programs (MHvE), pp. 99–119.
ICALP-1976-Greif #on the #proving: On Proofs of Programs for Synchronization (IG), pp. 494–507.
ICALP-1976-Kroger #logic #reasoning: Logical Rules of Natural Reasoning about Programs (FK), pp. 87–98.
ICALP-1976-Schwarz #proving #reasoning #termination: Event Based Reasoning — A System for Proving Correct Termination of Programs (JS), pp. 131–146.
ICALP-1976-Sintzoff #backtracking: Eliminating Blind Alleys from Backtrack Programs (MS), pp. 531–557.
POPL-1976-Baker #algorithm: An Algorithm for Structuring Programs (BSB), pp. 113–126.
ICSE-1976-BasuM: Some Classes of Naturally Provable Programs (SKB, JM), pp. 400–406.
ICSE-1976-Gries #correctness #proving: An Illustration of Current Ideas on the Derivation of Correctness Proofs and Correct Programs (DG), p. 200.
ICSE-1976-PimontR #analysis #assessment #behaviour #reliability: A Software Reliability Assessment Based on a Structural and Behavioral Analysis of Programs (SP, JCR), pp. 486–491.
ICSE-1976-WulfLS #verification: An Introduction to the Construction and Verification of Alphard Programs (WAW, RLL, MS), p. 390.
SOSP-J-1975-OwickiG76 #approach #axiom #parallel #verification: Verifying Properties of Parallel Programs: An Axiomatic Approach (SSO, DG), pp. 279–285.
DAC-1976-Ho #analysis #preprocessor: A preprocessor for structural analysis programs (PKH), pp. 17–24.
STOC-1976-Doeppner #abstraction #on the #parallel: On Abstractions of Parallel Programs (TWDJ), pp. 65–72.
STOC-1976-Owicki #consistency #deduction #parallel #verification: A Consistent and Complete Deductive System for the Verification of Parallel Programs (SSO), pp. 73–86.
POPL-1975-JonesM: Even Simple Programs are Hard to Analyze (NDJ, SSM), pp. 106–118.
DAC-1975-AllevaCGP #evaluation #implementation #simulation: A simulation system for implementation and evaluation of diagnostic programs of a special-purpose telecommunication switching processor (IA, MGC, RG, FP), pp. 123–133.
DAC-1975-Foster #analysis: Prerouting analysis programs (JCF), pp. 306–310.
SOSP-1975-BrundageB: Computational Processor Demands of Algol-60 Programs (REB, APB), pp. 161–168.
STOC-1975-MannaS #recursion: The Optimal Fixedpoint of Recursive Programs (ZM, AS), pp. 194–206.
STOC-1975-OppenC #data type #proving: Proving Assertions about Programs that Manipulate Data Structures (DCO, SAC), pp. 107–116.
SIGFIDET-1974-RamirezRP #automation #generative #using: Automatic Generation of Data Conversion Programs Using A Data Description Language (JAR, NAR, NSP), pp. 207–225.
SIGFIDET-1974-YamaguchiM: Methodology for Transferring Programs and Data (KY, AGM), pp. 141–155.
ICALP-1974-Ausiello #complexity #recursion #semantics: Relations between Semantics and Complexity of Recursive Programs (GA), pp. 129–140.
ICALP-1974-Kandzia #algol #on the: On the Most Recent Property of Algol-Like Programs (PK), pp. 97–111.
DAC-1974-Kjelkerud #generative #performance #testing: A system of computer programs for efficient test generation for combinational switching circuits (EK), pp. 166–168.
STOC-1974-VairavanD #parallel #scheduling #strict: Parallel Scheduling of Programs in a Restricted Model of Computation (KV, RAD), pp. 248–255.
POPL-1973-WaldingerL #reasoning: Reasoning About Programs (RJW, KNL), pp. 169–182.
DAC-1973-Miyoshi #automation #generative: Automatic generation of diagnostic programs for TOSBAC — 5400/150 (AM), pp. 213–221.
STOC-1973-Kosaraju #analysis: Analysis of Structured Programs (SRK), pp. 240–252.
STOC-1972-Sethi #validation: Validating Register Allocations for Straight Line Programs (RS), pp. 222–237.
SIGIR-1971-HuntK #data transformation: A Heathkit Method for Building Data Management Programs (EH, GAK), pp. 117–131.
DAC-1971-Nagamine #automation #design #logic: An automated method for designing logic circuit diagnostic programs (MN), pp. 236–241.
DAC-1970-Cole #automation #functional #generative #logic #simulation: Automatic generation of functional logic test programs through simulation (FBC), pp. 116–127.
DAC-1970-Quiet #automation: An automated method for producing diagnostic programs (EQ), pp. 132–137.
STOC-1970-Constable #on the #recursion: On the Size of Programs in Subrecursive Formalisms (RLC), pp. 1–9.
SOSP-1969-Kernighan #segmentation: Optimal segmentation points for programs (BWK), pp. 47–53.
DAC-1968-KadisTVHG #layout: Building block programs for the layout of printed circuit boards utilizing integrated circuit packs (DAPSYS V.2) (RWK, KLT, WJVJ, WLH, CEG).
DAC-1967-Pritchard #analysis #overview: A survey of transient circuit analysis programs (GKP).
SHARE-1965-Bolino #problem: Manpower training problems and programs (ACB).
LISP-1963-Thomas #array #lisp #using: Use of arrays in LISP. Group theory programs (BST), p. 11.
LISP-1963-Yates #analysis #compilation #lisp #word: LISP. Group Analysis programs. Λ LISP Compiler for a variable word machine (Gamma 30 Scientific) (RY), p. 15.